Cuttings for disks and axis-aligned rectangles in three-space (Q848675): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Partitioning arrangements of lines. I: An efficient deterministic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Space Partitions for Fat Rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees crossing few barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertical decompositions for triangles in 3-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Min-Max Spanning Tree Problem and some extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting hyperplanes for divide-and-conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4515159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A singly exponential stratification scheme for real semi-algebraic varieties and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic view of random sampling and its use in geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-optimal range searching in spaces of finite VC-dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of random sampling in computational geometry. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting and representing intersections among triangles in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-nets and simplex range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized linear-time algorithm to find minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost tight upper bounds for vertical decompositions in four dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp bounds for vertical decompositions of linear arrangements in four dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curve-Sensitive Cuttings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting hyperplane arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4657590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient binary space partitions for hidden-surface removal and solid modeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal binary space partitions for orthogonal objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Point Location and Motion Planning among Simplices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On counting pairs of intersecting segments and off-line triangle range searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Clarkson–Shor Technique Revisited and Extended / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology for Computing / rank
 
Normal rank

Latest revision as of 13:06, 2 July 2024

scientific article
Language Label Description Also known as
English
Cuttings for disks and axis-aligned rectangles in three-space
scientific article

    Statements

    Cuttings for disks and axis-aligned rectangles in three-space (English)
    0 references
    0 references
    0 references
    0 references
    4 March 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    computational geometry
    0 references
    cuttings
    0 references
    simplicial partition
    0 references
    binary space partition
    0 references
    spanning tree
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references