Skip to main content

Robust Geometric Computation Based on Digital Topology

  • Conference paper
Computing and Combinatorics (COCOON 2004)

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

Included in the following conference series:

  • 573 Accesses

Abstract

This paper presents a new scheme for designing numerically robust geometric algorithms based on topological consistency. The topology-based approach is one of the most successful principle for designing robust algorithms to solve geometric problems, which the author’s group has been developed for a long time. This approach generates efficient algorithms because the floating-point arithmetic can be used, but is not a beginners’ technique because topological invariants for individual problems are required in the design of the algorithms. The new scheme presented here uses digital topology instead of individual invariants, and hence will change the topology-based approach from a middle-level technique to a beginners’ level technique. The basic idea together with its application to wire bundling is presented.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Guibas, L., Salesin, D., Stolfi, J.: Epsilon geometry—Building robust algorithms from imprecise computations. In: Proc. 5th ACM Annual Symposium on Computational Geometry, Saarbrücken, May 1989, pp. 208–217 (1989)

    Google Scholar 

  2. Imai, T.: A topology-oriented algorithm for the Voronoi diagram of polygon. In: Proceedings of the 8th Canadian Conference on Computational Geometry, pp. 107–112 (1996)

    Google Scholar 

  3. Inagaki, H., Sugihara, K., Sugie, N.: Numerically robust incremental algorithm for constructing three-dimensional Voronoi diagrams. In: Proceedings of the 6th Canadian Conference Computational Geometry, Newfoundland, August 1992, pp. 334–339 (1992)

    Google Scholar 

  4. Kim, D.-S., Kim, D., Sugihara, K.: Voronoi diagram of a circle set from Voronoi diagram of a point set, I. Topology. Computer Aided Geometric Design 18, 541–562 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Kim, D.-S., Kim, D., Sugihara, K.: Voronoi diagram of a circle set from Voronoi diagram of a point set, II. Geometry. Computer Aided Geometric Design 18, 563–585 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kobayashi, K., Sugihara, K.: Crystal Voronoi diagram and its applications. Future Generation Computer Systems 18, 681–692 (2002)

    Article  Google Scholar 

  7. Milenkovic, V.: Verifiable implementations of geometric algorithms using finite precision arithmetic. Artificial Intelligence 37, 377–401 (1988)

    Article  MATH  Google Scholar 

  8. Minakawa, T., Sugihara, K.: Topology-oriented construction of threedimensional convex hulls. Optimization Methods and Software 10, 357–371 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  9. Nishida, T., Sugihara, K.: Approximation of the boat-sail Voronoi diagram and its applications. In: Proceedings of the 4th International Conference on Computational Science and Its Applications, Perugia, May 14-17 (2004) (to appear)

    Google Scholar 

  10. Oishi, Y., Sugihara, K.: Topology-oriented divide-and-conquer algorithm for Voronoi diagrams. Computer Vision, Graphics, and Image Processing: Graphical Models and Image Processing 57, 303–314 (1995)

    Google Scholar 

  11. Sugihara, K.: A robust and consistent algorithm for intersecting convex polyhedra. In: Computer Graphics Forum, EUROGRAPHICS 1994, Oslo, pp. C-45–C-54 (1994)

    Google Scholar 

  12. Sugihara, K.: How to make geometric algorithms robust. IEICE Transactions on Information and Systems E83-D, 447–454 (2000)

    Google Scholar 

  13. Sugihara, K., Iri, M.: A solid modelling system free from topological inconsistency. Journal of Information Processing 12, 380–393 (1989)

    MATH  Google Scholar 

  14. Sugihara, K., Iri, M.: Construction of the Voronoi diagram for one million generators in single-precision arithmetic. Proceedings of the IEEE 80, 1471–1484 (1992)

    Article  Google Scholar 

  15. Sugihara, K., Iri, M.: A robust topology-oriented incremental algorithm for Voronoi diagrams. International Journal of Computational Geometry and Applications 4, 179–228 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  16. Sugihara, K., Iri, M., Inagaki, H., Imai, T.: Topology-oriented implementation–An approach to robust geometric algorithms. Algorithmica 27, 5–20 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  17. Sugihara, K., Sawai, M., Sano, H., Kim, D.-S., Kim, D.: Disk packing for the estimation of the size of a wire bundle. Japan Journal of Industrial and Applied Mathematics (to appear)

    Google Scholar 

  18. Yap, C.K.: The exact computation paradigm. In: Du, D.-Z., Hwang, F. (eds.) Computing in Euclidean Geometry, 2nd edn., pp. 452–492. World Scientific, Singapore (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sugihara, K. (2004). Robust Geometric Computation Based on Digital Topology. In: Chwa, KY., Munro, J.I.J. (eds) Computing and Combinatorics. COCOON 2004. Lecture Notes in Computer Science, vol 3106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27798-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27798-9_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22856-1

  • Online ISBN: 978-3-540-27798-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics