Approximate range searching using binary space partitions (Q2489539): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.comgeo.2005.08.003 / rank
Normal rank
 
Property / author
 
Property / author: Mark T. de Berg / rank
Normal rank
 
Property / author
 
Property / author: Mark T. de Berg / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041492362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Box-trees and R-trees with near-optimal query time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Space Partitions for Fat Rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surface Approximation and Geometric Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate range searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding scenes against invasive hypercubes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear size binary space partitions for uncluttered scenes / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on binary space partitions in the plane (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realistic input models for geometric algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-nets and simplex range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Box-trees for collision checking in industrial installations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storing line segments in partition trees / 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: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on binary plane partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Space Partitions for Line Segments with a Limited Number of Directions / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COMGEO.2005.08.003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:43, 18 December 2024

scientific article
Language Label Description Also known as
English
Approximate range searching using binary space partitions
scientific article

    Statements

    Approximate range searching using binary space partitions (English)
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    Geometric data structures
    0 references
    Approximate range searching
    0 references
    Binary space partitions
    0 references
    Realistic input models
    0 references

    Identifiers