Visualisation of implicit algebraic curves

Proceedings - Pacific Conference on Computer Graphics and Applications

Volumn , Issue , 2007, Pages 303-312

  Alberti, L ^a,b   Mourrain, B ^a  

^a INRIA   (France)

^b UNIVERSITÉ DE NICE SOPHIA ANTIPOLIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; BOOLEAN FUNCTIONS; COLOR IMAGE PROCESSING; COMPUTATIONAL GEOMETRY; COMPUTER APPLICATIONS; COMPUTER GRAPHICS; GRAPHIC METHODS; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION; POLYNOMIALS; TOPOLOGY; VISUALIZATION;

ALGEBRAIC CURVES; BERNSTEIN BASIS; IN ORDER; NEW ALGORITHM; REGIONS OF INTEREST (ROI); SINGULAR POINTS; TOPOLOGICAL DEGREE;

CURVES (ROAD);

EID: 46749114809     PISSN: 15504085     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PG.2007.66     Document Type: Conference Paper

References (31)

1. L. Alberti, G. Comte, and B. Mourrain. Meshing implicit algebraic surfaces: the smooth case. In L.L. Schumaker M. Maehlen, K. Morken, editor, Mathematical Methods for Curves and Surfaces: Tromso'04, pages 11-26. Nashboro, 2005.
2. J. Gerardo Alcázar and J. Rafael Sendra. Computing the topology of real algebraic space curves. J. Symbolic Comput., 39:719-744, 2005.
3. S. Basu, R. Pollack, and M.-F. Roy. Algorithms in Real Algebraic Geometry. Springer-Verlag, Berlin, 2003. ISBN 3-540-00973-6.
4. J.-S. Cheng, X.-S. Gao, and M. Li. Determining the topology of real algebraic surfaces. In Mathematics of Surfaces, number 3604 in LNCS, pages 121-146. Springer-Verlag, 2005.
5. G. E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Proc. 2nd GI Conference on Automata Theory and Formal Languages, volume 33 of Lecture Notes Comput. Sci., pages 134-183. SpringerVerlag, 1975.
6. A. Dickenstein, M.J. Rojas, Rusekz K., Shihx, and J. Extremal real algebraic geometry and adiscriminants. Preprint, 2007.
7. A. Eigenwillig, V. Sharma, and C. K. Yap. Almost tight recursion tree bounds for the descartes method. In ISSAC '06: Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, pages 71-78. ACM Press. New York, NY, USA, 2006.
8. G. Elber and M.-S Kim. Geometric constraint solver using multivariate rational spline functions. In Proc. of 6th ACM Symposium on Solid Modelling and Applications, pages 1-10. ACM Press, 2001.
9. I. Z. Emiris, B. Mourrain, and E. P. Tsigaridas. Real algebraic numbers: Complexity analysis and experimentations. In Reliable Implementation of Real Number Algorithms: Theory and Practice, LNCS. Springer-Verlag, 2007. To appear (also available at http://hal.inria.fr/inria-00071370).
10. G. Farin. Curves and surfaces for computer aided geometric design : a practical guide. Comp, science and sci. computing. Acad. Press, 1990.
11. G. Gatellier, A. Labrouzy, B. Mourrain, and J.-P. Técourt. Computing the topology of 3dimensional algebraic curves. In Computational Methods for Algebraic Spline Surfaces, pages 27-44. Springer-Verlag, 2005.
12. L. González-Vega and I. Necula. Efficient topology determination of implicitly defined algebraic plane curves. Comput. Aided Geom. Design, 19(9):719-743, 2002.
13. T. A. Grandine and F. W. Klein. A new approach to the surface intersection problem. Computer Aided Geometric Design, 14:111-134, 1997.
14. J. Hass, R. T. Farouki, C. Y. Han, X. Song, and T. W. Sederberg. Guaranteed Consistency of Surface Intersections and Trimmed Surfaces Using a Coupled Topology Resolution and Domain Decomposition Scheme. Advances in Computational Mathematics, 2007. To appear.
15. T. Fukuda et W. Z. Sun K. Aoki. On the number of branches of a plane curve germ. Kodai Math. Journal, 9:179-187, 1986.
16. J. Keyser, T. Culver, D. Manocha, and S. Krishnan. Efficient and exact manipulation of algebraic points and curves. Computer-Aided Design, 32(11):649-662, 2000.
17. G. N. Khimšiašvili. The local degree of a smooth mapping. Sakharth. SSR Meen. Akad. Moambe, 85(2):309-312, 1977.
18. C. Liang, B. Mourrain, and J.P. Pavone. Subdivision methods for 2d and 3d implicit curves. In Computational Methods for Algebraic Spline Surfaces, pages 171-186. Springer-Verlag, 2007.
19. N. G. Lloyd. Degree theory. Cambridge University Press, Cambridge, 1978. Cambridge Tracts in Mathematics, No. 73.
20. W. Lorensen and H. Cline. Marching cubes: a high resolution 3d surface construction algor ithm. Comput. Graph., 21(4):163-170, 1987.
21. B. Mourrain and J.-P. Pavone. Subdivision methods for solving polynomial equations. Technical Report 5658, INRIA Sophia-Antipolis, 2005.
22. B. Mourrain, F. Rouillier, and M.-F. Roy. Bernstein's basis and real root isolation, pages 459-478. Mathematical Sciences Research Institute Publications. Cambridge University Press, 2005.
23. B. Mourrain and J.P. Técourt. Isotopic meshing of a real algebraic surface. Technical Report 5508, INRIA Sophia-Antipolis, 2005.
24. B. Mourrain, M. Vrahatis, and J. Yakoubsohn. On the complexity of isolating real roots and computing with certainty the topological degree. Journal of Complexity, 18:612-640, 2002.
25. Helmut Ratschek and Jon G. Rokne. Scci-hybrid methods for 2d curve tracing. Int. J. Image Graphics, 5(3):447-480, 2005.
26. Angela Rösch, Matthias Ruhl, and Dietmar Saupe. Interactive visualization of implicit surfaces with singularities. In Implicit Surfaces, pages 73-87, 1996.
27. T. Sederberg. Algorithm for algebraic curve intersection. Computer Aided Design, 21:547-554, 1989.
28. J.-K. Seong, G. Elber, and M.-S. Kim. Contouring 1- and 2-Manifolds in Arbitrary Dimensions. In SMI'05, pages 218-227, 2005.
29. E. C. Sherbrooke and N. M. Patrikalakis. Computation of the solutions of nonlinear polynomial systems. Comput. Aided Geom. Design, 10(5):379-405, 1993.
30. n. Numer. Math., 25(1):23-38, 1975.
31. Z. Szafraniec. On the number of branches of a 1-dimensional semianalytic set. Kodai Math. J., 11(1):78-85, 1988.