Skip to main content
SpringerLink
Log in

A new duality result concerning Voronoi diagrams

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 226))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aurenhammer, F. Power diagrams — properties, algorithms and applications. To appear in SIAM J. Comp.

    Google Scholar 

  2. Aurenhammer, F. A criterion for the affine equivalence of cell complexes in E d and convex polyhedra in E d+1. Rep. 205, IIG, Tech. Univ. of Graz, Austria (1985).

    Google Scholar 

  3. Brown, K.Q. Voronoi diagrams from convex hulls. Inf. Proc. Lett. 9 (1979), 223–228.

    Google Scholar 

  4. Chazelle, B., Edelsbrunner, H. An improved algorithm for constructing k th-order Voronoi diagrams. Proc. ACM Symp. on Computational Geometry (1985), 228–234.

    Google Scholar 

  5. Edelsbrunner, H. Constructing edge-skeletons in three dimensions with applications to power diagrams and dissecting three-dimensional point-sets. Rep. 140, IIG, Tech. Univ. of Graz, Austria (1984).

    Google Scholar 

  6. Edelsbrunner, H., O'Rourke, J., Seidel, R. Constructing arrangements of lines and hyperplanes with applications. Proc. 24th Ann. IEEE Symp. Found. Comput. Sci. (1983), 83–91.

    Google Scholar 

  7. Lee, D.T. On k-nearest neighbor Voronoi diagrams in the plane. IEEE Trans. Comput. C-31 (1982), 478–487.

    Google Scholar 

  8. Preparata, F.P., Hong, S.J. Convex hulls of finite sets of points in two and three dimensions. Comm. ACM (1977), 87–93.

    Google Scholar 

  9. Seidel, R. A convex hull algorithm optimal for point-sets in even dimensions. M.S. Thesis, Rep. 81-14, Dep. Comp. Sci., Univ. of British Columbia, Vanc. (1981).

    Google Scholar 

  10. Shamos, M.I., Hoey, D. Closest-point problems. Proc. 16th. Ann. IEEE Symp. Found. Comput. Sci. (1975), 151–162.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institutes for Information Processing, TU Graz and Austrian Computer Society, A-8010, Graz, Austria

    F. Aurenhammer

Authors
  1. F. Aurenhammer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Laurent Kott

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aurenhammer, F. (1986). A new duality result concerning Voronoi diagrams. In: Kott, L. (eds) Automata, Languages and Programming. ICALP 1986. Lecture Notes in Computer Science, vol 226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16761-7_51

Download citation

  • DOI: https://doi.org/10.1007/3-540-16761-7_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16761-7

  • Online ISBN: 978-3-540-39859-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation