Intersections and circuits in sets of line segments
From MaRDI portal
Publication:2084612
DOI10.1007/s10878-021-00731-3zbMath1504.90114OpenAlexW3154128210MaRDI QIDQ2084612
Boris Brimkov, Jordan Broussard, Alathea Jensen, Pouria Salehi Nowbandegani, Jesse T. Geneson
Publication date: 18 October 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00731-3
Cites Work
- Unnamed Item
- Unnamed Item
- On sets defining few ordinary lines
- Segment representation of a subclass of co-planar graphs
- Approximation algorithms for a geometric set cover problem
- Memory efficient algorithms for cactus graphs and block graphs
- Computing simple circuits from a set of line segments
- Guarding a set of line segments in the plane
- Space-efficient geometric divide-and-conquer algorithms
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection
- On Halin subgraphs and supergraphs
- Drawing plane triangulations with few segments
- The geometry and combinatorics of discrete line segment hypergraphs
- Drawings of planar graphs with few slopes and segments
- Line-segment intersection made in-place
- Approximability issues of guarding a set of segments
- Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments
- Algorithms for Reporting and Counting Geometric Intersections
- Centdian Computation in Cactus Graphs
- Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- The Number of Intersection Points Made by the Diagonals of a Regular Polygon
- Triangle-Free Planar Graphs and Segment Intersection Graphs
- Halin graphs and the travelling salesman problem
- On Sets of Line Segments Featuring a Cactus Structure
- Triangulations of Line Segment Sets in the Plane
- An efficient search algorithm to find the elementary circuits of a graph
- Simple Recognition of Halin Graphs and Their Generalizations
- On the Number of Husimi Trees
