Practical distribution-sensitive point location in triangulations (Q2637075): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(10 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Pedro Machado Manhães de Castro / rank
Normal rank
 
Property / author
 
Property / author: Pedro Machado Manhães de Castro / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Stony Brook / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Spatial Sorting / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: point location strategies / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CGAL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: 2D triangulations / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cagd.2013.02.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991995218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple entropy-based algorithm for planar point location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the delaunay triangulation of points on surfaces the smooth case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5729634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stabbing number of a random Delaunay triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear Geometric Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymptotic growth rate of some spanning trees embedded in \(\mathbb R^d\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pedagogic JavaScript program for point location strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximate point searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE DELAUNAY HIERARCHY / rank
 
Normal rank
Property / cites work
 
Property / cites work: WALKING IN A TRIANGULATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on point location in Delaunay triangulations of random points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expected time analysis for Delaunay point location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex hulls of samples from spherically symmetric distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural filtering: a paradigm for efficient and exact geometric programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: General spacefilling curve heuristics and limit theory for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Dirichlet Tessellations in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental study of point location in planar arrangements in CGAL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expected asymptotically optimal planar point location / rank
 
Normal rank
Property / cites work
 
Property / cites work: A static optimality transformation with applications to planar point location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximate planar point location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search in Planar Subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for expected-case planar point location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spacefilling curves and the planar travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4110292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabbing Delaunay tetrahedralizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3499247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost of sequential connection for points in space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 08:29, 7 July 2024

scientific article
Language Label Description Also known as
English
Practical distribution-sensitive point location in triangulations
scientific article

    Statements

    Practical distribution-sensitive point location in triangulations (English)
    0 references
    19 February 2014
    0 references
    point location
    0 references
    Delaunay triangulation
    0 references
    geometric graph
    0 references
    jump \& walk
    0 references
    keep, jump, \& walk
    0 references
    keep, jump, \& climb
    0 references
    algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers