Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »

Activity for purplenaniteā€­

Type On... Excerpt Status Date
Comment Post #292671 I think i have the wrong impression with my question - my data is very high dimensional, so i'm not certain reject sampling would work very well? And i'm not sure how to generate a bounding box using vectors $\vec{G}_j$ and values $v_j$?
(more)
19 days ago
Edit Post #292671 Post edited:
Included a second set of edits meant to demonstrate the dimensionality of the problem
19 days ago
Comment Post #292671 I think this is a case of me not knowing the correct terminology. It is in a *very* high-dimensional space, i should have said something like "the (boundary/hypersurface)... normal to the vector $\vec{G}_k$" I'll change the question to better reflect this.
(more)
19 days ago
Comment Post #292671 Thank you, i specified the interior in the edit.
(more)
21 days ago
Edit Post #292671 Post edited:
specified interior of shape
21 days ago
Edit Post #292671 Initial revision 21 days ago
Question How do I (efficiently) sample from the interior of a convex polytope?
I wish to sample a "typical" point in the interior of a convex polytope. The volume is defined by vectors $\vec{G}k$ and values $vk$ such that $\forall k,(\vec{X} \cdot \vec{G}k) > vk$. However, I also have an additional point $\vec{X}j$ which is guaranteed to be on the boundary of the convex poly...
(more)
21 days ago
Comment Post #291375 This doesn't quite solve the problem, but since a,b are not equal to 0, you can get rid of them without loss of generality. For example, dividing by a will just get rid of the variable "a", and leave c/a and d/a, so you can set a=1 likewise, you can transform bx->x, at the cost of cx-> c/b x but ...
(more)
5 months ago