Pages that link to "Item:Q1380808"

The following pages link to Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams (Q1380808):

Displayed 11 items.

• Optimal partition trees (Q420575) ‎ (← links)
• A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations (Q471140) ‎ (← links)
• Space-efficient planar convex hull algorithms (Q596137) ‎ (← links)
• Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) ‎ (← links)
• Complexity of the Delaunay triangulation of points on polyhedral surfaces (Q1434252) ‎ (← links)
• Convex hulls of spheres and convex hulls of disjoint convex polytopes (Q1947973) ‎ (← links)
• On constant factors in comparison-based geometric algorithms and data structures (Q2349854) ‎ (← links)
• On Some Proximity Problems of Colored Sets (Q2867120) ‎ (← links)
• 3D boundary recovery by constrained Delaunay tetrahedralization (Q3018042) ‎ (← links)
• Adaptive tetrahedral mesh generation by constrained Delaunay refinement (Q3590399) ‎ (← links)
• Computing the multicover bifiltration (Q6174807) ‎ (← links)