Approximating the k-Level in Three-Dimensional Plane Arrangements (Q4604386): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4633824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Deterministic Shallow Cuttings for 3D Dominance Ranges / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general approach for cache-oblivious range reporting and approximate range counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning arrangements of lines. I: An efficient deterministic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning arrangements of lines. II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic half-space range reporting and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surface Approximation and Geometric Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On levels in arrangements of lines, segments, planes, and triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for the Union of Locally Fat Objects in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering the Plane with Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Dimensional Linear Programming with Violations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting hyperplanes for divide-and-conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4643852 / 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: A singly exponential stratification scheme for real semi-algebraic varieties and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: New applications of random sampling in computational geometry / 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: Combinatorial complexity bounds for arrangements of curves and spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding up the incremental construction of the union of geometric objects in practice. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Planar Cuttings in Theory and Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative \((p,\varepsilon )\)-approximations in geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the k-Level in Three-Dimensional Plane Arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured recursive separator decompositions for planar graphs in linear time / 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: Curve-Sensitive Cuttings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of \(\epsilon\)-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient partition trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Range searching with efficient hierarchical cuttings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reporting points in halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constants for cuttings in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fat Triangles Determine Linearly Many Holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small simple cycle separators for 2-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for hidden surface removal. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325546 / rank
 
Normal rank

Latest revision as of 06:07, 15 July 2024

scientific article; zbMATH DE number 6843456
Language Label Description Also known as
English
Approximating the k-Level in Three-Dimensional Plane Arrangements
scientific article; zbMATH DE number 6843456

    Statements

    Approximating the k-Level in Three-Dimensional Plane Arrangements (English)
    0 references
    0 references
    0 references
    0 references
    26 February 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    hyperplane arrangements
    0 references
    cuttings
    0 references
    triangulations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references