Pages that link to "Item:Q3890127"
From MaRDI portal
The following pages link to Two-Dimensional Voronoi Diagrams in the <i> L <sub>p</sub> </i> -Metric (Q3890127):
Displaying 50 items.
- The higher-order Voronoi diagram of line segments (Q261375) (← links)
- Proximity problems for points on a rectilinear plane with rectangular obstacles (Q675298) (← links)
- Randomized incremental construction of abstract Voronoi diagrams (Q685599) (← links)
- An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations (Q749241) (← links)
- On the construction of abstract Voronoi diagrams (Q757052) (← links)
- Delaunay triangulation and the convex hull of n points in expected linear time (Q799379) (← links)
- Stable marker-particle method for the Voronoi diagram in a flow field (Q875380) (← links)
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions (Q908209) (← links)
- A divide-and-conquer algorithm for constructing relative neighborhood graph (Q911282) (← links)
- A theory of rectangular dual graphs (Q923112) (← links)
- Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric (Q1037776) (← links)
- On computing all north-east nearest neighbors in the \(L_ 1\) metric (Q1055197) (← links)
- Traveling salesman cycles are not always subgraphs of Voronoi duals (Q1055435) (← links)
- The one-dimensional weighted Voronoi diagram (Q1071508) (← links)
- Voronoi diagrams and arrangements (Q1079823) (← links)
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments (Q1093370) (← links)
- The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric (Q1093374) (← links)
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations (Q1094872) (← links)
- On the geodesic Voronoi diagram of point sites in a simple polygon (Q1115602) (← links)
- Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics (Q1165014) (← links)
- Parallel computation of distance transforms (Q1175646) (← links)
- Sorting helps for Voronoi diagrams (Q1355725) (← links)
- An analytical solution to the minimum \(L_ p\)-norm of a hyperplane (Q1363554) (← links)
- On the asymptotics of quantizers in two dimensions (Q1364668) (← links)
- A case against convexity in conceptual spaces (Q1708896) (← links)
- Representing geometric structures in \(d\) dimensions: Topology and order (Q1802222) (← links)
- Parallel geometric algorithms on a mesh-connected computer (Q1825643) (← links)
- Extending range queries and nearest neighbors (Q1841241) (← links)
- Voronoi-like partition of lattice in cellular automata (Q1914936) (← links)
- Steiner minimal trees in \(L^ 2_ p\) (Q1923480) (← links)
- On Voronoi diagrams in the \(L_p\)-metric in \(\mathbb{R}^D\). (Q1923773) (← links)
- On shape Delaunay tessellations (Q2015147) (← links)
- Sparse spatially clustered coefficient model via adaptive regularization (Q2084064) (← links)
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
- Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments (Q2248734) (← links)
- Computing a minimum-width cubic and hypercubic shell (Q2294346) (← links)
- The \(k\)-nearest-neighbor Voronoi diagram revisited (Q2346966) (← links)
- An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram (Q2367127) (← links)
- Voronoi diagrams over dynamic scenes (Q2367408) (← links)
- Boat-sail Voronoi diagram on a curved surface (Q2388263) (← links)
- A scheme for computing minimum covers within simple regions (Q2428655) (← links)
- A note on minimum-sum coverage by aligned disks (Q2445326) (← links)
- The geometry of Minkowski spaces -- a survey. II. (Q2571082) (← links)
- Boat-sail Voronoi diagram and its computation based on a cone-approximation scheme (Q2583115) (← links)
- Computation of compact distributions of discrete elements (Q2632514) (← links)
- Empty squares in arbitrary orientation among points (Q2700381) (← links)
- ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM (Q2932519) (← links)
- A Scheme for Computing Minimum Covers within Simple Regions (Q3183475) (← links)
- Skew Jensen-Bregman Voronoi Diagrams (Q3223927) (← links)
- Continuous-Time Moving Network Voronoi Diagram (Q3223928) (← links)
