Intersections and circuits in sets of line segments (Q2084612): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Centdian Computation in Cactus Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Reporting and Counting Geometric Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-efficient geometric divide-and-conquer algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulations of Line Segment Sets in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Line Segments Featuring a Cactus Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory efficient algorithms for cactus graphs and block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability issues of guarding a set of segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding a set of line segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for a geometric set cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halin graphs and the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawings of planar graphs with few slopes and segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-Free Planar Graphs and Segment Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing plane triangulations with few segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Recognition of Halin Graphs and Their Generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Segment representation of a subclass of co-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sets defining few ordinary lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Husimi Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Halin subgraphs and supergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry and combinatorics of discrete line segment hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Intersection Points Made by the Diagonals of a Regular Polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing simple circuits from a set of line segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient search algorithm to find the elementary circuits of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line-segment intersection made in-place / rank
 
Normal rank

Latest revision as of 13:20, 30 July 2024

scientific article
Language Label Description Also known as
English
Intersections and circuits in sets of line segments
scientific article

    Statements

    Intersections and circuits in sets of line segments (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 October 2022
    0 references
    0 references
    intersection points
    0 references
    circuits
    0 references
    Halin graph
    0 references
    cactus graph
    0 references
    maximal planar graph
    0 references
    triangle-free planar graph
    0 references
    0 references
    0 references
    0 references