Practical efficiencies of planar point location algorithms

Satoshi Kagami*, Masato Edahiro, Takao Asano

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


The planar point location problem is one of the most fundamental problems in computational geometry and stated as follows: Given a straight line planar graph (subdivision) with n vertices and an arbitrary query point Q, determine the region containing Q. Many algorithms have been proposed, and some of them are known to be theoretically optimal O(log n) search time, O(n) space and O(nlogn) processing time). In this paper, we implement several representative algorithms in C, and investigate their practical efficiencies by computational experiments on Voronoi diagram with 210 - 217 vertices.

Original languageEnglish
Pages (from-to)608-614
Number of pages7
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number4
Publication statusPublished - 1994 Apr
Externally publishedYes

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'Practical efficiencies of planar point location algorithms'. Together they form a unique fingerprint.

Cite this