Optimal time bounds for some proximity problems in the plane
From MaRDI portal
Publication:1198024
DOI10.1016/0020-0190(92)90133-GzbMATH Open0761.68093OpenAlexW2034144081MaRDI QIDQ1198024FDOQ1198024
Alok Aggarwal, Prabhakar Raghavan, Prasoon Tiwari, Herbert Edelsbrunner
Publication date: 16 January 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(92)90133-g
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Finding the convex hull of a simple polygon
- Geometric applications of a matrix-searching algorithm
- Generalized Delaunay triangulation for planar graphs
- A linear algorithm for finding the convex hull of a simple polygon
- The all nearest-neighbor problem for convex polygons
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- On Some Proximity Problems of Colored Sets
- Lower bounds for approximate polygon decomposition and minimum gap
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances
- Expected computations on color spanning sets
- COMPUTING CLOSEST POINTS FOR SEGMENTS
- Spanning trees in multipartite geometric graphs
- Finding a shortest diagonal of a simple polygon in linear time
- An optimal algorithm for computing visible nearest foreign neighbors among colored line segments
Recommendations
This page was built for publication: Optimal time bounds for some proximity problems in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198024)
