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 127131
Questions about algorithmic solutions of geometric problems, or other algorithms making usage of geometry.
1
vote
1
answer
100
views
Prove an edge that minimizes the Euclidean distance crossing a cut is in the Delaunay triang...
Let $P$ and $Q$ be two disjoint point sets in the plane. (Think of them as a red point set and a black point set.) Let $p \in P$ and $q \in Q$ be two points from these sets that minimize the
Euclidean …
- 157
2
votes
Checking whether a set of points in the plane can be bi-partitioned with a certain diameter
Your problem may be mapped into graph partitioning algorithm. There you can use spectral graph partitioning algorithm.
I am just giving you brief here. What spectral graph partitioning does is:
Firs …
- 157