Computing a Face in an Arrangement of Line Segments and Related Problems
DOI10.1137/0222077zbMATH Open0799.68182OpenAlexW2060544933MaRDI QIDQ4277544FDOQ4277544
Authors: Jack Snoeyink, Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir 
Publication date: 24 February 1994
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0222077
Recommendations
arrangementscomputational geometryDavenport-Schinzel sequencesrandomized incremental algorithmsprobabilistic backwards analysis
Discrete mathematics in relation to computer science (68R99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Real and complex geometry (51M99)
Cited In (25)
- On lazy randomized incremental construction
- Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection
- Title not available (Why is that?)
- COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
- The number of edges of many faces in a line segment arrangement
- On computing connected components of line segments
- A fast planar partition algorithm. I
- Constructing many faces in arrangements of lines and segments
- Computing a single cell in the overlay of two simple polygons
- A fast planar partition algorithm, II
- Title not available (Why is that?)
- Describing faces in plane triangulations
- Implicitly representing arrangements of lines or segments
- The complexity and construction of many faces in arrangements of lines and of segments
- On lazy randomized incremental construction
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams
- AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE
- The complexity of the outer face in arrangements of random segments
- Segments in enumerating faces
- An introduction to randomization in computational geometry
- Robot motion planning and the single cell problem in arrangements
- Rounding Arrangements Dynamically
- Almost tight upper bounds for the single cell and zone problems in the three dimensions
- On Computing the Centroid of the Vertices of an Arrangement and Related Problems
- Arrangements of segments that share endpoints: Single face results
This page was built for publication: Computing a Face in an Arrangement of Line Segments and Related Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277544)
