Skip to main content
SpringerLink
Log in

A Non-uniform Binary Space Partition Algorithm for 2D Implicit Curves

  • Conference paper
  • First Online:
Computational Science and Its Applications — ICCSA 2003 (ICCSA 2003)

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

Included in the following conference series:

  • 1478 Accesses

Abstract

Current graphical systems include primitives to draw straight-line segments, circles, Bézier curves and surfaces, NURBS (Non-Uniform Rational B-Splines), but many of them fail displaying curve singularities (self-intersections) correctly. This paper introduces a fast and robust non-uniform binary space partition (BSP) algorithm for implicit curves possibly with self-intersections and other differentiable singularities. These singularities are computed without using traditional differential techniques.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Allgower, E. and Georg, K. Numerical Continuation Methods: An Introduction. Springer-Verlag, (1990)

    Google Scholar 

  2. Allgower, E., Gnutzmann, S.: Simplicial Pivoting for Mesh Generation of Implicitly Defined Surfaces. Computer Aided Geometric Design, Vol. 8, (1991) 305–325

    Article  MATH  MathSciNet  Google Scholar 

  3. Akai, Terrence J.: Applied Numerical Methods for Engineers. John Wiley Λ Sons Inc (1994)

    Google Scholar 

  4. Blinn, J.: A Generalization of Algebraic Surface drawing, ACM Transactions on Graphics. Vol. 1,No. 3, (1982) 235–256

    Article  Google Scholar 

  5. Bloomenthal, J.: Poligonisation of implicit surfaces. Computer Aided Geometric Design, Vol. 5, (1988) 341–355

    Article  MATH  MathSciNet  Google Scholar 

  6. Bloomenthal, J.: An Implicit Surface polygonizer. Graphics Gems, IV, (1994)

    Google Scholar 

  7. Chandler, R.: A tracking algorithm for implicitly defined curves. IEEE Computer Graphics Λ Applications, Vol. 8,No. 2, (1988) 83–89

    Article  MathSciNet  Google Scholar 

  8. Keyser, J., Culver, T., Manocha, D., Krishnan, S.: MAPC a library for efficient and exact mnipulation of algebric points and curves. Proceedings of the 15th ACM Symposium on Computational Geometry, (1999) 360–369

    Google Scholar 

  9. Krishnan, S., Manocha, D.: Numeric symbolic algorithms for evaluating onedimensional algebric sets. Proceedings of ACM Symposium and Algebraic Computation, (1995) 59–67

    Google Scholar 

  10. Lopes, H., Oliveira, J.B., Figueiredo, L. H.: Robust Adaptive Polygonal Approximation of Implicit Curves. Proceedings of SibGrapi (2001)

    Google Scholar 

  11. Lorensen, W., Cline, W.: Marching Cubes: A High Resolution 3D Surface Construction Algorithm. Computer Graphics, Vol. 21,No. 4, (1987) 163–169

    Article  Google Scholar 

  12. Moller, T., Yagel, R.: Efficient Rasterization of Implicit Functions. (1995). (http://citeseer.nj.nec.com/357413.html)

  13. Shewchuk, J.: Adaptative precision floating-point arithmetic and fast robust geometric predicates. Discrete Computational Geometry, Vol. 18,No. 3, (1997) 305–363

    Article  MATH  MathSciNet  Google Scholar 

  14. Snyder, J.: Interval arithmetic for computer graphics. Proceedings of ACM Siggraph, (1992) 121–130

    Google Scholar 

  15. Triquet, F., at al.: Fast Polygonization of Implicit Surfaces. WSCG’ 2001, Vol 2. (2001) 283–290

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Networks and Multimedia Group - Institute for Telecommunications (IT) Department of Informatics, University of Beira Interior, 6200-001, Covilhã, Portugal

    Francisco Morgado & Abel Gomes

Authors
  1. Francisco Morgado
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abel Gomes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Army High Performance Computing Research Center, USA University of Minessota Department of Computer Science and Engineering, MN, 55455, USA

    Vipin Kumar

  2. Department of Computer Science, University of Calgary, Calgary, AB, T2N1N4, Canada

    Marina L. Gavrilova

  3. Heuchera Technologies Inc., 122 9251-8Yonge Street, Richmond Hill, ON, Canada, L4C 9T3

    Chih Jeng Kenneth Tan

  4. School of Computer Science, The Queen’s University of Belfast, Belfast, BT7 1NN, Northern Ireland UK

    Chih Jeng Kenneth Tan

  5. Département d’informatique et de recherche opérationelle Montréal, Université de Montréal, Québec, H3C 3J7, Canada

    Pierre L’Ecuyer

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Morgado, F., Gomes, A. (2003). A Non-uniform Binary Space Partition Algorithm for 2D Implicit Curves. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44842-X_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-44842-X_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40156-8

  • Online ISBN: 978-3-540-44842-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation