Abstract
We present a new quadtree-based decomposition of a polygon possibly with holes. For a polygon of n vertices, a truncated decomposition can be computed in O(n log n) time which yields a Steiner triangulation of the interior of the polygon that has O(n log n) size and approximates the minimum weight Steiner triangulation (MWST) to within a constant factor. An approximate MWST is good for ray shooting in the average case as defined by Aronov and Fortune. The untruncated decomposition also yields an approximate MWST. Moreover, we show that this triangulation supports query-sensitive ray shooting as defined by Mitchell, Mount, and Suri. Hence, there exists a Steiner triangulation that is simultaneously good for ray shooting in the query-sensitive sense and in the average case.
Research supported in part by RGC CERG HKUST 650/95E.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
B. Aronov and S. Fortune, Average-case ray shooting and minimum weight triangulation, in Proc. 13th ACM Symposium on Computational Geometry, 204–211, 1997.
S. Arya, S.W. Cheng, and D.M. Mount, Approximation algorithms for multiple-tool milling, Proc. 14th ACM Symposium on Computational Geometry 1998, 297–306.
M. Bern, D. Eppstein, and J. Gilbert, Provably good mesh generation, Journal of Computer and System Sciences, 48 1994 384–409.
M. de Berg, M. Katz, A.F. van der Stappen, J. Vleugels, Realistic input models for geometric algorithms, in Proc. 13th ACM Symposium on Computational Geometry, 294–303, 1997.
D. Eppstein, Approximating the minimum weight Steiner triangulation, Discrete & Computational Geometry, 11 1994 163–191.
K.Y. Fung, T.M. Nicholl, R.E. Tarjan, and C.J. Van Wyk, Simplified linear-time Jordan sorting and polygon clipping. Information Processing Letters, 35 1990 85–92.
J.S.B. Mitchell, D.M. Mount, and S. Suri, Query-sensitive ray shooting, International Journal of Computational Geometry & Applications, 7 1997 317–347.
F.P. Preparata and M.I. Shamos. Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheng, SW., Lee, KH. (1998). Quadtree Decomposition, Steiner Triangulation, and Ray Shooting. In: Chwa, KY., Ibarra, O.H. (eds) Algorithms and Computation. ISAAC 1998. Lecture Notes in Computer Science, vol 1533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49381-6_39
Download citation
DOI: https://doi.org/10.1007/3-540-49381-6_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65385-1
Online ISBN: 978-3-540-49381-5
eBook Packages: Springer Book Archive