Expected asymptotically optimal planar point location (Q1883578): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.comgeo.2004.03.010 / 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.comgeo.2004.03.010 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2041808700 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2721994 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2768303 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2768304 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Triangulating a simple polygon in linear time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5501857 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2768317 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal Search in Planar Subdivisions / 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 / DOI | |||
Property / DOI: 10.1016/J.COMGEO.2004.03.010 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:31, 16 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Expected asymptotically optimal planar point location |
scientific article |
Statements
Expected asymptotically optimal planar point location (English)
0 references
13 October 2004
0 references
point location
0 references
distribution-sensitive data structures
0 references
triangulation
0 references
entropy bound
0 references