Intersections and circuits in sets of line segments
type: Item
instance of: scholarly article
title: Intersections and circuits in sets of line segments
zbMATH Open document ID: 1504.90114
author: Boris Brimkov
author: Alathea Jensen
author: Jordan Broussard
author: Pouria Salehi Nowbandegani
author: Jesse Geneson
published in: Journal of Combinatorial Optimization
publication date: 2022-10-18T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7603269
zbMATH Keywords: intersection points
zbMATH Keywords: circuits
zbMATH Keywords: Halin graph
zbMATH Keywords: cactus graph
zbMATH Keywords: maximal planar graph
zbMATH Keywords: triangle-free planar graph
MaRDI profile type: Publication
full work available at URL: s10878-021-00731-3
OpenAlex ID: W3154128210
cites work: Centdian Computation in Cactus Graphs
cites work: Algorithms for Reporting and Counting Geometric Intersections
cites work: Space-efficient geometric divide-and-conquer algorithms
cites work: Triangulations of Line Segment Sets in the Plane
cites work: On Sets of Line Segments Featuring a Cactus Structure
cites work: Memory efficient algorithms for cactus graphs and block graphs
cites work: Approximability issues of guarding a set of segments
cites work: Guarding a set of line segments in the plane
cites work: Approximation algorithms for a geometric set cover problem
cites work: Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection
cites work: Halin graphs and the travelling salesman problem
cites work: Drawings of planar graphs with few slopes and segments
cites work: Triangle-Free Planar Graphs and Segment Intersection Graphs
cites work: Drawing plane triangulations with few segments
cites work: Simple Recognition of Halin Graphs and Their Generalizations
cites work: Segment representation of a subclass of co-planar graphs
cites work: On sets defining few ordinary lines
cites work: On the Number of Husimi Trees
cites work: On Halin subgraphs and supergraphs
cites work: Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments
cites work: Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs
cites work: An Algorithmic Approach to Network Location Problems. I: Thep-Centers
cites work: The geometry and combinatorics of discrete line segment hypergraphs
cites work: The Number of Intersection Points Made by the Diagonals of a Regular Polygon
cites work: Q3992847
cites work: Computing simple circuits from a set of line segments
cites work: Q3322145
cites work: An efficient search algorithm to find the elementary circuits of a graph
cites work: Line-segment intersection made in-place
DOI: 10.1007/S10878-021-00731-3
Recommended article: Intersections of lines and circles
Recommended article: Intersection graphs of segments
Recommended article: Curves which Intersect Lines in Finite Sets
Recommended article: Intersection Graphs of Rectangles and Segments
Recommended article: Intersection patterns of curves
Recommended article: Intersection algorithms for lines and circles
Recommended article: Intersections of convex bodies
Recommended article: Intersections of graphs
Recommended article: Intersection graphs of halflines and halfplanes
description: scientific article; zbMATH DE number 7603269