Abdullah Zawawi Talib
ABSTRACT
Kirkpatrick's method is extensively used to solve planar point location problem. In this paper we develop an efficient implementation for Kirkpatrick's method by developing an efficient version of the algorithms associated with the method. Efficient data structures for these more efficient algorithms are formulated. Computational experiments that were conducted verify the practical efficiency of our proposed implementation.
- de BERG M., SCHWARZKOPF O., van ICREVELD M., OVERMASS M. 2000, Computational Geometry: Algorithms and Applications, 2nd rev. ed. Springer-Verlag. Google Scholar
Digital Library
- EDAHIRO M., KOKUBO I., AND ASANO T. 1984, "New Point-Location Algorithm and Its Practical Efficiency - Comparison with Existing Algorithms", ACM Transaction On Graphics, Vol. 3, No. 2, pp. 86--109. Google ScholarDigital Library
- KIRKPATRICK D. G. 1983, "Optimal Search in Planar Subdivisions", SIAM Journal on Computing, Vol. 12, No. 1, pp. 28--35,Google ScholarCross Ref
- GOODMAN J. E. AND O'ROURKE J. (EDS.) 1997, "Handbook of Discrete and Computational Geometry", CRC Press LLC. Google ScholarDigital Library
- KAGAMI S., EDAHIRO M., AND ASANO T. 1994, "Practical Efficiencies of Point Location Algorithms", IEICE Transaction on Fundamentals of Electronic Communications and Computer Sciences, Vol. E77A, No. 4, pp. 608--614.Google Scholar
- PLAISTED D. A. AND HONG J., 1987 "A Heuristic Triangulation Algorithm", Journal of Algorithms, Vol. 8, pp. 405--437. Google ScholarDigital Library
- PRASAD M. 1991, "Intersection of Line Segments", in Graphics Gem II, T. Arvo(ed.), Academic Press, pp. 7--9.Google Scholar
- PREPARATA F.P. AND SHAMOS M. I. 1985, Computational Geometry: An Introduction, Springer-Verlag. Google ScholarDigital Library
- TALIB A, CHEN M, AND TOWNSEND P. 1996, "Three Major Extensions to Kirkpatrick's Point Location Algorithm", Proceedings of Computer Graphics International '96, IEEE Computer Society, pp. 112--121. Google ScholarDigital Library
- Efficient implementation of a planar point location method
Recommendations
Acyclically 4-colorable triangulations
An acyclic k-coloring of a graph is a proper vertex k-coloring such that every bichromatic subgraph, induced by this coloring, contains no cycles. A graph is acyclically k-colorable if it has an acyclic k-coloring. In this paper, we prove that every ...
Domination of maximal K 4 -minor free graphs and maximal K 2 , 3 -minor free graphs, and disproofs of two conjectures on planar graphs
It is well known that a graph is outerplanar if and only if it is K 4 -minor free and K 2 , 3 -minor free. Campos and Wakabayashi (2013) recently proved that γ ( G ) n + k 4 for any maximal outerplanar graph G of order n 3 with k vertices of degree 2, ...
Comments