Concepedia

Logarithmic-time Point Location

Logarithmic-Time Point Location is a computational method in computational geometry that enables determining the location of a query point within a preprocessed planar subdivision in time logarithmic relative to the number of edges, distinguished by its optimal asymptotic efficiency for static subdivisions.

3

Publications

137

Citations

6

Authors

6

Institutions

Publications per year

2017–2026

0

Parents

Publications

3

1–3 of 3

Authors

6

  1. KM
    Ketan Mulmuley

    University of Chicago, United States

    1 publications · 22 citations

    1

    h-index

  2. SV
    Saša V. Raković

    Imperial College London, United Kingdom

    1 publications · 68 citations

    1

    h-index

  3. PG
    P. Grieder

    ETH Zurich, Switzerland

    1 publications · 68 citations

    1

    h-index

  4. MP
    Mihai Ptraşcu

    Massachusetts Institute of Technology, United States

    1 publications · 47 citations

    1

    h-index

  5. CN
    Colin N. Jones

    École Polytechnique Fédérale de Lausanne, Switzerland

    1 publications · 68 citations

    1

    h-index

1–5 of 6

Institutions

6

  1. University of Illinois Chicago

    Chicago, United States

    1 h-index

    1 publications

    22 citations

  2. University of Waterloo

    Waterloo, Canada

    1 h-index

    1 publications

    47 citations

  3. Imperial College London

    London, United Kingdom

    1 h-index

    1 publications

    68 citations

  4. École Polytechnique Fédérale de Lausanne

    Lausanne, Switzerland

    1 h-index

    1 publications

    68 citations

  5. University of Cambridge

    Cambridge, United Kingdom

    1 h-index

    1 publications

    68 citations

  6. University of Chicago

    Chicago, United States

    1 h-index

    1 publications

    22 citations

1–6 of 6

Venues

  1. Automatica

    1 publications · 68 citations

    1

    h-index

  2. SIAM Journal on Computing

    1 publications · 47 citations

    1

    h-index

1–2