Practical efficiencies of planar point location algorithms

Satoshi Kagami, Masato Edahiro, Takao Asano

研究成果: Article査読

1 被引用数 (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.

本文言語English
ページ(範囲)608-614
ページ数7
ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E77-A
4
出版ステータスPublished - 1994 4
外部発表はい

ASJC Scopus subject areas

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

フィンガープリント 「Practical efficiencies of planar point location algorithms」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル