Pages that link to "Item:Q3711764"

The following pages link to Primitives for the manipulation of general subdivisions and the computation of Voronoi (Q3711764):

Displaying 50 items.

• Voronoi diagrams of rigidly moving sets of points (Q1199886) (← links)
• Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation (Q1208536) (← links)
• On the randomized construction of the Delaunay tree (Q1210297) (← links)
• A nearly parallel algorithm for the Voronoi diagram of a convex polygon (Q1269914) (← links)
• Spheres, molecules, and hidden surface removal (Q1272310) (← links)
• Transforming curves on surfaces (Q1288203) (← links)
• A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works (Q1304467) (← links)
• Computing minimum length paths of a given homotopy class (Q1330462) (← links)
• Point placement algorithms for Delaunay triangulation of polygonal domains (Q1330781) (← links)
• Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\) (Q1334932) (← links)
• A new algorithm for shortest paths among obstacles in the plane (Q1356167) (← links)
• Theorem on four support vertices of a polygonal line (Q1357916) (← links)
• Erased arrangements of linear and convex decompositions of polyhedra (Q1384196) (← links)
• Remarks on the computation of the horizon of a digital terrain (Q1412555) (← links)
• Triangulations in CGAL (Q1602941) (← links)
• Delaunay refinement algorithms for triangular mesh generation (Q1602942) (← links)
• Regular triangulations of dynamic sets of points (Q1605465) (← links)
• Untangling planar curves (Q1688858) (← links)
• A hierarchical representation and computation scheme of arbitrary-dimensional geometrical primitives based on CGA (Q1695110) (← links)
• A fast algorithm for computing irreducible triangulations of closed surfaces in \(\mathbb{E}^d\) (Q1699303) (← links)
• Interior boundary-aligned unstructured grid generation and cell-centered versus vertex-centered CVD-MPFA performance (Q1710303) (← links)
• Planar minimally rigid graphs and pseudo-triangulations (Q1775778) (← links)
• Representing geometric structures in \(d\) dimensions: Topology and order (Q1802222) (← links)
• A nearly optimal deterministic parallel Voronoi diagram algorithm (Q1817002) (← links)
• Storing the subdivision of a polyhedral surface (Q1820438) (← links)
• Voronoi diagrams with barriers and on polyhedra for minimal path planning (Q1822055) (← links)
• Applications of random sampling in computational geometry. II (Q1823685) (← links)
• A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case (Q1841245) (← links)
• A new bound for map labeling with uniform circle pairs (Q1847377) (← links)
• Optimal and suboptimal robust algorithms for proximity graphs (Q1873154) (← links)
• The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra (Q1873157) (← links)
• Expected time analysis for Delaunay point location (Q1882851) (← links)
• An optimal bound for high-quality conforming triangulations (Q1911767) (← links)
• Computing half-plane and strip discrepancy of planar point sets (Q1917044) (← links)
• Reverse search for enumeration (Q1917258) (← links)
• On Delaunay oriented matroids for convex distance functions (Q1923774) (← links)
• Decremental 2- and 3-connectivity on planar graphs (Q1924402) (← links)
• Optimal tetrahedralization of the 3D-region ``between'' a convex polyhedron and a convex polygon (Q1924710) (← links)
• On shape Delaunay tessellations (Q2015147) (← links)
• Tubular parametric volume objects: thickening a piecewise smooth 3D stick figure (Q2020360) (← links)
• Three-dimensional unstructured gridding for complex wells and geological features in subsurface reservoirs, with CVD-MPFA discretization performance (Q2020717) (← links)
• A distributed algorithm to maintain a proximity communication network among mobile agents using the Delaunay triangulation (Q2034245) (← links)
• Practical unstructured splines: algorithms, multi-patch spline spaces, and some applications to numerical analysis (Q2088347) (← links)
• Boundary layer mesh generation with fast collision detection (Q2172357) (← links)
• Efficient representation of Laguerre mosaics with an application to microstructure simulation of complex ore (Q2198932) (← links)
• Reachable region query and its applications (Q2201650) (← links)
• Polynomial-reproducing spline spaces from fine zonotopal tilings (Q2237924) (← links)
• Reprint of: Delaunay refinement algorithms for triangular mesh generation (Q2249046) (← links)
• Distributed combinatorial maps for parallel mesh processing (Q2287496) (← links)
• Liftings and stresses for planar periodic frameworks (Q2351014) (← links)