Pages that link to "Item:Q3953183"
From MaRDI portal
The following pages link to On k-Nearest Neighbor Voronoi Diagrams in the Plane (Q3953183):
Displayed 30 items.
- Order-k Voronoi diagrams of sites with additive weights in the plane (Q802900) (← links)
- On levels in arrangements and Voronoi diagrams (Q804321) (← links)
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon (Q911267) (← links)
- Applications of generalized matrix searching to geometric algorithms (Q913505) (← links)
- Constructing minimum-interference networks (Q929744) (← links)
- Region-restricted clustering for geographic data mining (Q1000925) (← links)
- Depth of segments and circles through points enclosing many points: A note (Q1005330) (← links)
- Halfspace range search: An algorithmic application of k-sets (Q1077166) (← links)
- Edge-skeletons in arrangements with applications (Q1091825) (← links)
- Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs (Q1199461) (← links)
- On the randomized construction of the Delaunay tree (Q1210297) (← links)
- Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765) (← links)
- Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements (Q1317487) (← links)
- A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem (Q1329426) (← links)
- Compact location problems (Q1391322) (← links)
- Structural tolerance and Delaunay triangulation (Q1606996) (← links)
- 2-point site Voronoi diagrams (Q1613413) (← links)
- Higher order Delaunay triangulations (Q1614071) (← links)
- New applications of random sampling in computational geometry (Q1820582) (← links)
- On the number of line separations of a finite set in the plane (Q1821352) (← links)
- A linear time algorithm for the bottleneck biconnected spanning subgraph problem (Q1847357) (← links)
- A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids (Q1894952) (← links)
- Algorithms for proximity problems in higher dimensions (Q1917037) (← links)
- A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis (Q2366225) (← links)
- Voronoi diagrams over dynamic scenes (Q2367408) (← links)
- Computing closest and farthest points for a query segment (Q2481974) (← links)
- Euclidean push--pull partial covering problems (Q2496058) (← links)
- Delaunay configurations and multivariate splines: A generalization of a result of B. N. Delaunay (Q3431202) (← links)
- Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction (Q5387806) (← links)
- A new duality result concerning Voronoi diagrams (Q5899690) (← links)