Intersections and circuits in sets of line segments
From MaRDI portal
Recommendations
- Intersections of lines and circles
- Intersection graphs of segments
- Curves which Intersect Lines in Finite Sets
- Intersection Graphs of Rectangles and Segments
- Intersection patterns of curves
- Intersection algorithms for lines and circles
- Intersections of convex bodies
- Intersections of graphs
- Intersection graphs of halflines and halfplanes
Cites work
- Algorithms for Reporting and Counting Geometric Intersections
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An efficient search algorithm to find the elementary circuits of a graph
- Approximability issues of guarding a set of segments
- Approximation algorithms for a geometric set cover problem
- Centdian computation in cactus graphs
- Computing simple circuits from a set of line segments
- Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments
- Drawing plane triangulations with few segments
- Drawings of planar graphs with few slopes and segments
- Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs
- Guarding a set of line segments in the plane
- Halin graphs and the travelling salesman problem
- scientific article; zbMATH DE number 3853133 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- Line-segment intersection made in-place
- Memory efficient algorithms for cactus graphs and block graphs
- On Halin subgraphs and supergraphs
- On sets defining few ordinary lines
- On sets of line segments featuring a cactus structure
- On the Number of Husimi Trees
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection
- Segment representation of a subclass of co-planar graphs
- Simple recognition of Halin graphs and their generalizations
- Space-efficient geometric divide-and-conquer algorithms
- The geometry and combinatorics of discrete line segment hypergraphs
- The Number of Intersection Points Made by the Diagonals of a Regular Polygon
- Triangle-Free Planar Graphs and Segment Intersection Graphs
- Triangulations of Line Segment Sets in the Plane
Cited in
(7)- Joins and intersections
- Joins, tangencies and intersections
- scientific article; zbMATH DE number 1786524 (Why is no real title available?)
- On sets of line segments featuring a cactus structure
- scientific article; zbMATH DE number 6392005 (Why is no real title available?)
- Computing simple circuits from a set of line segments
- Intersections of lines and circles
This page was built for publication: Intersections and circuits in sets of line segments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084612)
