On Higher Order Voronoi Diagrams of Line Segments

No abstract is available for this paper.

• Publication year

  2012

• Venue

  International Symposium on Algorithms and Computation

• Publication date

  2012-12-19

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-35261-4_21
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Voronoi Diagrams

  2021cited by this paper
• Net-Aware Critical Area Extraction for Opens in VLSI Circuits Via Higher-Order Voronoi Diagrams

  2011cited by this paper
• A robust and efficient implementation for the segment Voronoi diagram

  2004cited by this paper
• Handbook of computational geometry

  2000cited by this paper
• Davenport-Schinzel sequences and their geometric applications

  1995cited by this paper
• Constructing levels in arrangements and higher order Voronoi diagrams

  1994cited by this paper
• A semidynamic construction of higher-order voronoi diagrams and its randomized analysis

  1993cited by this paper
• Algorithms in Combinatorial Geometry

  1987cited by this paper
• AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments

  1987cited by this paper
• The Number of Small Semispaces of a Finite Set of Points in the Plane

  1984cited by this paper
• Stabbing line segments

  1982cited by this paper
• On k-Nearest Neighbor Voronoi Diagrams in the Plane

  1982influential reference
• Generalization of Voronoi Diagrams in the Plane

  1981cited by this paper
• Closest-point problems

  1975cited by this paper
• Industrial Geometry Industrial Geometry Computer Vision Farthest Line Segment Voronoi Diagrams

  year unknowninfluential reference

• On the Structure of Higher Order Voronoi Cells

  2018cites this paper
• An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams

  2018cites this paper
• A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams

  2016cites this paper
• Geometric kth shortest paths

  2015cites this paper
• Geometric k Shortest Paths

  2015cites this paper
• A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams

  2014cites this paper
• The Higher-Order Voronoi Diagram of Line Segments

  2014cites this paper
• Higher-order Voronoi diagrams of polygonal objects

  2014cites this paper
• An Expected Linear-Time Algorithm for the Farthest-Segment Voronoi Diagram

  2014cites this paper
• On the Complexity of Higher Order Abstract Voronoi Diagrams

  2013cites this paper
• Geometric k th Shortest Paths ∗

  2013cites this paper
• A Sweepline Algorithm for Higher Order Voronoi Diagrams

  2013influential citation