This author was supported by the ESPRIT II Basic Research Actions Program, under contract No. 3075 (project ALCOM).
Preview
Unable to display preview. Download preview PDF.
References
A. Aggarwal, M. Hansen and T. Leighton. Solving Query-Retrieval Problems by Compacting Voronoi Diagrams. PROC. OF THE 16TH STOC (1990), pp. 331–340.
B. Chazelle. Filtering Search: A New Approach to Query-Answering. SIAM J. OF COMP. vol. 15 (1986), pp. 703–724.
B. Chazelle. On the Convex Layers of a Planar Set. IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 31, no. 4 (1985), pp. 509–517.
B. Chazelle, R. Cole, F.P. Preparata and C. Yap. New Upper Bounds for Neighbor Searching. INFORMATION AND CONTROL, vol. 68 (1986), pp. 105–124.
B. Chazelle and H. Edelsbrunner. Optimal Solutions for a Class of Point Retrieval Problems. J. SYMBOLIC COMPUTATION, vol. 1 (1985), pp. 47–56.
R. Klein, O. Nurmi, T. Ottmann and D. Wood. A Dynamic Fixed Windowing Problem. ALGORITHMICA, vol. 4 (1989), pp. 535–550.
M.H. Overmars and J. van Leeuwen. Maintenance of Configurations in the Plane. J. COMPUT. SYST. SCI. vol. 23 (1981), pp. 166–204.
F.P. Preparata and M.I. Shamos. Computational Geometry: an Introduction. Springer-Verlag New York-Berlin-Heidelberg-Tokyo (1985).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lenhof, HP., Smid, M. (1991). An optimal construction method for generalized convex layers. In: Hsu, WL., Lee, R.C.T. (eds) ISA'91 Algorithms. ISA 1991. Lecture Notes in Computer Science, vol 557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54945-5_79
Download citation
DOI: https://doi.org/10.1007/3-540-54945-5_79
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54945-1
Online ISBN: 978-3-540-46600-0
eBook Packages: Springer Book Archive