Topologically sweeping visibility complexes via pseudotriangulations
From MaRDI portal
Publication:1816465
DOI10.1007/BF02712876zbMATH Open0857.68063OpenAlexW2147097381MaRDI QIDQ1816465FDOQ1816465
Authors: Michel Pocchiola, Gert Vegter 
Publication date: 26 November 1996
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02712876
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A linear-time algorithm for a special case of disjoint set union
- An optimal algorithm for intersecting line segments in the plane
- Can visibility graphs be represented compactly?
- Title not available (Why is that?)
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- Topologically sweeping an arrangement
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Greedoids
- An optimal visibility graph algorithm for triangulated simple polygons
- Visibility of disjoint polygons
- Minimal tangent visibility graphs
- DISTANCE VISIBILITY GRAPHS
- COMPUTATIONAL GEOMETRY COLUMN 18
- Sorting jordan sequences in linear time using level-linked search trees
- Title not available (Why is that?)
- Time and space efficient algorithms for shortest paths between convex polygons
- Literate programming
- A fast algorithm for computing sparse visibility graphs
- Title not available (Why is that?)
Cited In (37)
- On planar path transformation
- Title not available (Why is that?)
- VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME
- SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS
- The brick polytope of a sorting network
- Multitriangulations, pseudotriangulations and primitive sorting networks
- Visibility and ray shooting queries in polygonal domains
- ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX
- Planar minimally rigid graphs and pseudo-triangulations
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
- Combinatorial pseudo-triangulations
- Pre-triangulations and liftable complexes
- Pointed binary encompassing trees: simple and optimal
- Quickest visibility queries in polygonal domains
- Alternating paths along axis-parallel segments
- An Optimal Algorithm for Computing Visibility in the Plane
- Locating an obnoxious line among planar objects
- Minimum weight pseudo-triangulations
- Empty pseudo-triangles in point sets
- Enumerating pseudo-triangulations in the plane
- Brick polytopes of spherical subword complexes and generalized associahedra
- Minimal tangent visibility graphs
- Spiderman graph: visibility in urban regions
- Tight degree bounds for pseudo-triangulations of points
- On the number of pseudo-triangulations of certain point sets
- A sum of squares theorem for visibility (extended abstract)
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- The stochastic walk algorithms for point location in pseudo-triangulations
- Convexity minimizes pseudo-triangulations
- Segment endpoint visibility graphs are Hamiltonian
- Transforming pseudo-triangulations
- Kinetic collision detection between two simple polygons.
- Celebrating Loday's associahedron
- Decomposing a simple polygon into pseudo-triangles and convex polygons
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
- Computing pseudotriangulations via branched coverings
- On geometric path query problems
This page was built for publication: Topologically sweeping visibility complexes via pseudotriangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1816465)
