Pages that link to "Item:Q1101224"
From MaRDI portal
The following pages link to A sweepline algorithm for Voronoi diagrams (Q1101224):
Displaying 50 items.
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (Q283875) (← links)
- Distance-sensitive planar point location (Q283883) (← links)
- Local calculation of Voronoi diagrams (Q293475) (← links)
- Representation of segment Voronoi diagram by Bézier curves (Q300373) (← links)
- A faster circle-sweep Delaunay triangulation algorithm (Q427141) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Computing the map of geometric minimal cuts (Q476438) (← links)
- Adaptive least-squares finite element approximations to Stokes equations (Q484893) (← links)
- A new parallel algorithm for constructing Voronoi tessellations from distributed input data (Q525736) (← links)
- Optimal adaptive grids of least-squares finite element methods in two spatial dimensions (Q544215) (← links)
- The directed Hausdorff distance between imprecise point sets (Q553353) (← links)
- A generalized finite difference method using Coatmèlec lattices (Q603260) (← links)
- Perturbations for Delaunay and weighted Delaunay 3D triangulations (Q617544) (← links)
- The Zermelo-Voronoi diagram: a dynamic partition problem (Q624956) (← links)
- Farthest-polygon Voronoi diagrams (Q632728) (← links)
- Spanners of additively weighted point sets (Q635742) (← links)
- The legacy of automatic mesh generation from solid modeling (Q672240) (← links)
- An upper bound for conforming Delaunay triangulations (Q685182) (← links)
- Randomized incremental construction of abstract Voronoi diagrams (Q685599) (← links)
- A convex polygon among polygonal obstacle: Placement and high-clearance motion (Q685605) (← links)
- Oracle complexities for computional geometry of semi-algebraic sets and voronoi diagrams (Q753493) (← links)
- On the construction of abstract Voronoi diagrams (Q757052) (← links)
- Between shapes, using the Hausdorff distance (Q824335) (← links)
- Reverse shortest path problem for unit-disk graphs (Q832915) (← links)
- Algorithms for graphs of bounded treewidth via orthogonal range searching (Q833703) (← links)
- Farthest line segment Voronoi diagrams (Q845871) (← links)
- Shortest monotone descent path problem in polyhedral terrain (Q876505) (← links)
- An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs (Q916391) (← links)
- Fixed-radius near neighbors search algorithms for points and segments (Q916423) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- On maximum flows in polyhedral domains (Q918212) (← links)
- Solving continuous location-districting problems with Voronoi diagrams (Q947939) (← links)
- Voronoi diagrams of polygons: a framework for shape representation. (Q960438) (← links)
- A new clustering algorithm for coordinate-free data (Q962672) (← links)
- Uncertain Voronoi diagram (Q989461) (← links)
- Divide-and-conquer for Voronoi diagrams revisited (Q991182) (← links)
- A second-order accurate material-order-independent interface reconstruction technique for multi-material flow simulations (Q1000937) (← links)
- Voronoi diagram for services neighboring a highway (Q1007626) (← links)
- Single facility collection depots location problem in the plane (Q1025297) (← links)
- The transportation metric and related problems (Q1041811) (← links)
- Robustness of \(k\)-gon Voronoi diagram construction (Q1045919) (← links)
- Constrained Delaunay triangulations (Q1115601) (← links)
- On the geodesic Voronoi diagram of point sites in a simple polygon (Q1115602) (← links)
- Fixed-radius near neighbors search (Q1182100) (← links)
- Randomized incremental construction of Delaunay and Voronoi diagrams (Q1185289) (← links)
- Searching for segments with largest relative overlap (Q1186585) (← links)
- \(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116) (← links)
- A convex hull algorithm for discs, and applications (Q1188286) (← links)
- Fully dynamic Delaunay triangulation in logarithmic expected per operation (Q1199828) (← links)
- An all-round sweep algorithm for 2-dimensional nearest-neighbor problems (Q1203723) (← links)
