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 123142
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.
2
votes
Accepted
Algorithm for grouping tetrahedra from Voronoi diagram
Chapter 27 of The Handbook of Discrete and Computational Geometry
enumerates the complexity of known Delaunay triangulation algorithms of any dimension (see Table 27.2.1 there).
For 3D Delaunay the wo …
- 701
6
votes
Algorithm to compute the Voronoi diagram of points, line segments and triangles in $\mathbb{...
Voronoi diagrams of points in $R^3$ are now implemented in several software libraries and can be computed, for example, in a few lines of Python code.
This has not always been the case, so it still is …
- 701