Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with computational-geometry
Search options not deleted
user 46140
Using computers to solve geometric problems. Questions with this tag should typically have at least one other tag indicating what sort of geometry is involved, such as ag.algebraic-geometry or mg.metric-geometry.
3
votes
Accepted
Determining if a polygon is convex using relations on orientation of each ordered triple of ...
It's important to note that when it talks about ordered points, this is ordered by $x$-coordinate and not (as one might otherwise suppose) by traversing the edges of the polygon.
Suppose we have $n$ p …
- 7,226
1
vote
Accepted
On triangulations and "coverage" of circumcircles
It's sufficient to prove $D(\triangle abc) \subseteq D(\triangle abd) \cup D(\triangle bcd)$ by symmetry under permutation of the labels $b,d$.
Divide the circumcircle of $abc$ into three arcs: $\frow …
- 7,226
3
votes
Partition of polygons into 'congruent sets of polygons'
By the Wallace-Bolyai-Gerwien theorem it suffices to cut the polygon into $n$ sets of equal area, which can certainly be done by continuity of the area on one side of a line as you move the line acros …
- 7,226