Topological sweep of the complete graph
From MaRDI portal
Publication:1003474
DOI10.1016/j.dam.2008.06.019zbMath1161.05028OpenAlexW2078335304MaRDI QIDQ1003474
Diane L. Souvaine, Eynat Rafalin
Publication date: 4 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.06.019
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Computing colourful simplicial depth and Median in \(\mathbb{R}_2\) ⋮ Relative convex hulls in semi-dynamic arrangements ⋮ THE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Order-k Voronoi diagrams of sites with additive weights in the plane
- On a notion of data depth based on random simplices
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- The power of geometric duality
- The number of edges of many faces in a line segment arrangement
- Geometric medians
- Algorithms for bivariate medians and a Fermat-Torricelli problem for lines.
- Shattering a set of objects in 2D
- Corrigendum: Topologically sweeping an arrangement
- Algorithms for Reporting and Counting Geometric Intersections
- Reliable and Efficient Geometric Computing
- Computing Least Median of Squares Regression Lines and Guided Topological Sweep
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Comments on “algorithms for reporting and counting geometric intersections”
- Plane-sweep algorithms for intersecting geometric figures
- An optimal real-time algorithm for planar convex hulls
- An optimal algorithm for intersecting line segments in the plane
- WALKING IN AN ARRANGEMENT TOPOLOGICALLY
- TOPOLOGICAL PEELING AND APPLICATIONS
- Determining an optimal penetration among weighted regions in two and three dimensions
- A unified scheme for detecting fundamental curves in binary edge images
This page was built for publication: Topological sweep of the complete graph
