Pages that link to "Item:Q1873689"
From MaRDI portal
The following pages link to On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes (Q1873689):
Displaying 19 items.
- A tight bound for the Delaunay triangulation of points on a polyhedron (Q443906) (← links)
- Voronoi diagrams of random lines and flats (Q677015) (← links)
- Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull (Q814963) (← links)
- Intersections with random geometric objects (Q1392845) (← links)
- Complexity of the Delaunay triangulation of points on polyhedral surfaces (Q1434252) (← links)
- Voronoi diagrams and convex hulls of random moving points (Q1972308) (← links)
- Union of hypercubes and 3D Minkowski sums with random sizes (Q2022617) (← links)
- Randomized incremental construction of Delaunay triangulations of nice point sets (Q2039315) (← links)
- An efficient trivariate algorithm for tetrahedral Shepard interpolation (Q2302406) (← links)
- On the complexity of randomly weighted multiplicative Voronoi diagrams (Q2349856) (← links)
- Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points (Q2365326) (← links)
- Practical distribution-sensitive point location in triangulations (Q2637075) (← links)
- A simple algorithm for higher-order Delaunay mosaics and alpha shapes (Q2700389) (← links)
- Power particles: an incompressible fluid solver based on power diagrams (Q2802285) (← links)
- On the expected complexity of Voronoi diagrams on terrains (Q2874572) (← links)
- On the Complexity of Randomly Weighted Voronoi Diagrams (Q4635547) (← links)
- Union of Hypercubes and 3D Minkowski Sums with Random Sizes. (Q5002676) (← links)
- (Q5075759) (← links)
- The impact of heterogeneity and geometry on the proof complexity of random satisfiability (Q6063345) (← links)
