Abstract
This paper introduces a new algorithm for rendering implicit curves. It is curvature-adaptive. But, unlike most curve algorithms, no differentiation techniques are used to compute self-intersections and other singularities (e.g. corners and cusps). Also, of theoretical interest, it uses a new numerical method for sampling curves pointwise.
Chapter PDF
Similar content being viewed by others
References
Allgower, E., Gnutzmann, S.: Simplicial Pivoting for Mesh Generation of Implicitly Defined Surfaces. Comp. Aid. Geom. Des. 8, 30–46 (1991)
Abhyankar, S., Bajaj, C.: Automatic parameterization of rational curves and surfaces III: algebraic plane curves. Technical Report CSD-TR-619, Purdue University, Computer Science Department, USA (1987)
Arnon, D.: Topologically reliable display of algebraic curves. Comp. Graph. 17, 219–227 (1983)
Bloomenthal, J.: Poligonisation of implicit surfaces. Comp. Aid. Geom. Des. 5, 341–355 (1988)
Chandler, R.: A tracking algorithm for implicitly defined curves. IEEE Comp. Graph. and Appl. 8, 83–89 (1988)
Hobby, J.: Rasterization of nonparametric curves. ACM Trans. on Graph. 9, 262–277 (1990)
Keyser, J., Culver, T., Manocha, D., Krishnan, S.: MAPC: a library for efficient and exact manipulation of algebraic points and curves. In: Proceedings of the 15th ACM Symposium on Computational Geometry, pp. 360–369. ACM Press, New York (1999)
Krishnan, S., Manocha, D.: Numeric-symbolic algorithms for evaluating onedimensional algebraic sets. In: Proceedings of the ACM Symposium on Symbolic and Algebraic Computation, pp. 59–67 (1995)
Lopes, H., Oliveira, J., Figueiredo, L.: Robust adaptive polygonal approximation of implicit curves. In: Proceedings of the SibGrapi 2001, IEEE Computer Society, Los Alamitos (2001)
Lorensen, W., Cline, W.: Marching Cubes: A High Resolution 3D Surface Construction Algorithm. Comp. Graph. 21, 163–169 (1987)
Moeller, T., Yagel, R.: Efficient rasterization of implicit functions (1995), http://citeseer.nj.nec.com/357413.html
Press, W., Flannery, B., Teukolsky, S., Vetterling, W.: Numerical recipes in C: the art of scientific computing, 2nd edn. Cambridge University Press, Cambridge (1992)
Shewchuk, J.: Adaptive precision floating-point arithmetic and fast robust geometric predicates. Disc. and Comp. Geom. 18, 305–363 (1997)
Snyder, J.: Interval arithmetic for computer graphics. In: Proceedings of ACM SIGGRAPH 1992, pp. 121–130. ACM Press, New York (1992)
Taubin, G.: An accurate algorithm for rasterizing algebraic curves. In: Proceedings of the 2nd ACM Solid Modeling and Applications, pp. 221–230. ACM Press, New York (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morgado, J.F.M., Gomes, A.J.P. (2004). A Derivative-Free Tracking Algorithm for Implicit Curves with Singularities. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science - ICCS 2004. ICCS 2004. Lecture Notes in Computer Science, vol 3039. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25944-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-25944-2_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22129-6
Online ISBN: 978-3-540-25944-2
eBook Packages: Springer Book Archive