dogear

enter for all results · esc to close

Kirkpatrick's Point location

rkaneriya.github.iosite

A data structure and method for point location with O(n) space and O(log n) query time using triangulation.

from
Computational Geometry
added
2026-10-10
likes
0

similar

  1. k-d tree web.archive.org

    A method of partitioning k-dimensional space in an efficient way for searches like nearest neighbors.

  2. HackerRank hackerrank.com

    A set of programming problems using computational geometry.

  3. GitHub repository github.com

    libpointmatcher, a modular library implementing the ICP algorithm.

  4. Geometric Reasoning cs.cmu.edu
  5. go-rquad github.com

    Region quadtrees with efficient point location and neighbour finding.

  6. RamerDouglasPeucker gist.github.com

    Reduces number of points along a 2D line.

Computational Geometry › Algorithm Visualizations: “A data structure and method for point location with O(n) space and O(log n) query time using triangulation.”