On Some Proximity Problems of Colored Sets
From MaRDI portal
Publication:2867120
DOI10.1007/978-3-319-03780-6_18zbMath1407.05230OpenAlexW3023537241MaRDI QIDQ2867120
Jun Luo, Farong Zhong, Chenglin Fan
Publication date: 10 December 2013
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03780-6_18
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On the complexity of d-dimensional Voronoi diagrams
- Higher-dimensional Voronoi diagrams in linear expected time
- An O(n log n) algorithm for the all-nearest-neighbors problem
- Euclidean minimum spanning trees and bichromatic closest pairs
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions
- Optimal time bounds for some proximity problems in the plane
- Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams
- Computing farthest neighbors on a convex polytope.
- On some geometric problems of color-spanning sets
- Computing Minimum Diameter Color-Spanning Sets
- Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Extreme Distances in Multicolored Point Sets
- COMPUTING THE DIAMETER OF A POINT SET
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
- An optimal deterministic algorithm for computing the diameter of a three-dimensional point set
This page was built for publication: On Some Proximity Problems of Colored Sets
