, [49, 4] >> cut parameter: (u, v) = [22, 3] >> size of input: 4.0592, height of output: 0.75023 >> parameterization of line
, =(4*y*alpha-4*x*beta-3)^2+3*(2*x+beta)^2+12*(y+2*alpha)^2+75; > simplify
, = time(): > bs3:=factor(fgb_gbasis(bs2,0
, Computing critical values of a polynomial mapping from C^4 to C Computing asymptotic critical values of a polynomial mapping from C^4 to, Computing sampling points in a real hypersurface Computing Critical Points using FGb
, Line transversals of balls and smallest enclosing cylinders in three dimensions On lines avoiding unit balls in three dimensions Cost prediction for ray shooting The virtual mesh : A geometric abstraction for efficiently computing radiosity, On lines avoiding unit balls in three dimensions . Discrete and Computational Geometry Proceedings of the 20th ACM Annual Symposium on Computational Geometry Proceedings of the 18th ACM Annual Symposium on Computational Geometry (SoCG'02)Aga94] P. K. Agarwal. On stabbing lines for convex polyhedra in 3D. Computational Geometry : Theory and Applications Glisse, and X. Goaoc. On the worst-case complexity of the silhouette of a polytope Proceedings of the 15th Canadian Conference on Computational Geometry (CCCG'03) J. R. Sack and J. Urrutia Handbook of computational geometry, pp.231-250373, 1994.
, On the Theories of Triangular Sets, AP03a] P. Angelier and M. PocchiolaAP03b] P. Angelier and M. Pocchiola. A sum of squares theorem for visibility complexes and applications, pp.105-124, 1999.
DOI : 10.1006/jsco.1999.0269
URL : https://hal.archives-ouvertes.fr/hal-01148870
, Ray shooting amidst convex polyhedra and polyhedral terrains in three dimensions The common exterior of convex polygons in the plane [Aud] Audacity : The Free, Cross-Platform Sound Editor Voronoi diagrams ? a survey of a fundamental geometric data structure, Discrete and Computational Geometrysourceforge.net/. [Aur91] F. Aurenhammer Goaoc, S. Lazard, H.-S. Na, and S. Whitesides. On the number of lines tangent to four convex polyhedra Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG'02), pp.79-139100, 1991.
, The number of lines tangent to arbitrary polytopes in R 3, CHAPITRE 18. BIBLIOGRAPHIE Proceedings of the 20th ACM Annual Symposium on Computational Geometry, pp.46-55, 2004.
, On the number of maximal free line segments tangent to arbitrary threedimensional convex polyhedra, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00071226
, Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra, SIAM Journal on Computing, vol.37, issue.2, pp.522-551, 2007.
DOI : 10.1137/S0097539705447116
URL : https://hal.archives-ouvertes.fr/inria-00103916
, Visibility with a moving point of view, Algorithmica, vol.3, issue.4, pp.360-378, 1994.
DOI : 10.1007/BF01187019
, Line tangents to four triangles in threedimensional space, Proceedings of the 16th Canadian Conference on Computational Geometry, pp.184-187, 2004.
, Line tangents to four triangles in threedimensional space, 2005.
, Lines Tangent to Four Triangles in Three-Dimensional Space, Discrete & Computational Geometry, vol.37, issue.3, pp.369-380, 2007.
DOI : 10.1007/s00454-006-1278-3
, Triangulations in CGAL, Computational Geometry, vol.22, issue.1-3, pp.5-19, 2002.
DOI : 10.1016/S0925-7721(01)00054-2
URL : https://hal.archives-ouvertes.fr/hal-01179408
, Applications of random sampling to on-line algorithms in computational geometry, Discrete & Computational Geometry, vol.20, issue.1, pp.51-71, 1992.
DOI : 10.1007/BF02293035
URL : https://hal.archives-ouvertes.fr/inria-00075274
, Transversals to Line Segments in Three-Dimensional Space, Discrete & Computational Geometry, vol.34, issue.3, pp.381-390, 2005.
DOI : 10.1007/s00454-005-1183-1
, A separation bound for real algebraic expressions, Proceedings of the 9th Annual European Symposium on Algorithms, pp.254-265, 2001.
, On tangents to quadric surfaces. Preprint, arXiv:math, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00431701
, Common Tangents to Spheres in ???3, Discrete & Computational Geometry, vol.35, issue.2, pp.287-300, 2006.
DOI : 10.1007/s00454-005-1230-y
URL : https://hal.archives-ouvertes.fr/inria-00100261
, An exact, complete and efficient implementation for computing planar maps of quadric intersection curves, Proceedings of the 21st ACM Annual Symposium on Computational Geometry (SoCG'05), pp.99-115, 2005.
, ON THE DISTANCE BETWEEN ROOTS OF INTEGER POLYNOMIALS, Proceedings of the Edinburgh Mathematical Society, pp.553-556, 2004.
DOI : 10.1017/S0013091503000257
, Provably good sampling and meshing of surfaces, Graphical Models, vol.67, issue.5, pp.405-451, 2005.
DOI : 10.1016/j.gmod.2005.01.004
URL : https://hal.archives-ouvertes.fr/hal-00488829
, Robust Plane Sweep for Intersecting Segments, SIAM Journal on Computing, vol.29, issue.5, pp.1401-1421, 2000.
DOI : 10.1137/S0097539797329373
URL : https://hal.archives-ouvertes.fr/inria-00073419
, Quadratic Forms and Their Classification by Means of Invariant Factors, Cambridge Tracts in Mathematics and Mathematical Physics, 1906.
, Algorithmic Geometry, 1998.
DOI : 10.1017/CBO9781139172998
, Parabola separation queries and their application to stone throwing, International Journal of Computational Geometry and Applications, vol.17, issue.4, pp.349-360, 2007.
, Interactive ray tracing with the visibility complex, Special issue on Visibility -Techniques and Applications, pp.703-717, 1999.
DOI : 10.1016/S0097-8493(99)00093-X
, Computational Geometry Algorithms Library
, Geometric permutations of disjoint unit spheres, Computational Geometry, vol.30, issue.3, pp.253-270, 2005.
DOI : 10.1016/j.comgeo.2004.08.003
URL : https://hal.archives-ouvertes.fr/inria-00000637
, Triangulating a simple polygon in linear time, Discrete and Computational Geometry, vol.6, pp.485-524, 1991.
, Efficient solution of rational conics, Mathematics of Computation, vol.72, issue.243, pp.1417-1441, 2003.
DOI : 10.1090/S0025-5718-02-01480-1
, Applications of random sampling in computational geometry, II. Discrete and Computational Geometry, pp.387-421, 1989.
, Visibility problems for polyhedral terrains, Journal of Symbolic Computation, vol.7, issue.1, pp.11-30, 1989.
, Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams, Discrete & Computational Geometry, vol.18, issue.4, pp.433-454, 1997.
DOI : 10.1007/PL00009327
, Computing the Medial Axis of a Polyhedron Reliably and Efficiently The union of moving polygonal pseudodiscs ? combinatorial bounds and applications, Computational Geometry : Theory and Applications, vol.11, pp.69-82, 1998.
, Sparse Arrangements and the Number of Views of Polyhedral Scenes, International Journal of Computational Geometry & Applications, vol.07, issue.03, pp.175-195, 1997.
DOI : 10.1142/S0218195997000120
, Robust epsilon visibility, Proceedings of ACM SIGGRAPH 2002, pp.567-575, 2002.
DOI : 10.1145/566654.566618
URL : https://hal.archives-ouvertes.fr/inria-00606723
, The expected number of 3D visibility events is linear, SIAM Journal on Computing, vol.32, issue.6, pp.1586-1620, 2003.
, Between umbra and benumbra, Proceedings of the 23rd European Conference on Computational Geometry, 2007.
, The visibility skeleton, Proceedings of the 24th annual conference on Computer graphics and interactive techniques , SIGGRAPH '97, pp.89-100, 1997.
DOI : 10.1145/258734.258785
URL : https://hal.archives-ouvertes.fr/inria-00510088
, Fast and accurate hierarchical radiosity using global visibility, ACM Transactions on Graphics, vol.18, issue.2, pp.128-170, 1999.
DOI : 10.1145/318009.318012
URL : https://hal.archives-ouvertes.fr/inria-00073244
, The 3D visibility complex, ACM Transactions on Graphics, vol.21, issue.2, pp.176-206, 2002.
DOI : 10.1145/508357.508362
URL : https://hal.archives-ouvertes.fr/inria-00606717
, A fast shadow algorithm for area light sources using backprojection, Proceedings of the 21st annual conference on Computer graphics and interactive techniques , SIGGRAPH '94, pp.223-230, 1994.
DOI : 10.1145/192161.192207
URL : https://hal.archives-ouvertes.fr/inria-00510136
, Fast detection of polyhedral intersection, Theoretical Computer Science, vol.27, issue.3, pp.241-253, 1983.
DOI : 10.1016/0304-3975(82)90120-7
, Near-optimal parameterization of the intersection of quadrics, Proceedings of the nineteenth conference on Computational geometry , SCG '03, pp.246-255, 2003.
DOI : 10.1145/777792.777830
URL : https://hal.archives-ouvertes.fr/inria-00099789
, Near-optimal parameterization of the intersection of quadrics : I. The generic algorithm, 2005.
, Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils, Journal of Symbolic Computation, vol.43, issue.3, 2005.
DOI : 10.1016/j.jsc.2007.10.012
URL : https://hal.archives-ouvertes.fr/inria-00071228
, Near-optimal parameterization of the intersection of quadrics : III. Parameterizing singular intersections, 2005.
, Near-optimal parameterization of the intersection of quadrics : I. The generic algorithm, Accepted in Journal of Symbolic Computation, 2005.
, Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils, Accepted in Journal of Symbolic Computation, 2005.
DOI : 10.1016/j.jsc.2007.10.012
URL : https://hal.archives-ouvertes.fr/inria-00071228
, Near-optimal parameterization of the intersection of quadrics : III. Parameterizing singular intersections, Accepted in Journal of Symbolic Computation, 2005.
, On circular cylinders by four or five points in space, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00072427
, On circular cylinders by four or five points in space, Discrete Comput. Geom, vol.29, pp.83-104, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00072427
, Computer Algebra. Systems and algorithms for algebraic computation, 1993.
URL : https://hal.archives-ouvertes.fr/inria-00072643
, Shadow computations using robust epsilon visibility, Research Report, vol.5167, 2004.
, Paramétrage quasi-optimal de l'intersection de deux quadriques : théorie, algorithme et implantation, Thèse d'université, 2004.
, Visibilité tridimensionnelle : étude analytique et applications, 1999.
, A multidisciplinary survey of visibility, ACM Siggraph course notes, Visibility, Problems, Techniques, and Applications, 2000.
, Approximate medial axis as a voronoi subcomplex, SMA '02 : Proceedings of the seventh ACM symposium on Solid modeling and applications, pp.356-366, 2002.
, On incremental rendering of silhouette maps of a polyhedral scene, Proceedings of the 11th ACM-SIAM Symp. on Discrete Algorithms, pp.910-917, 2000.
DOI : 10.1016/j.comgeo.2006.12.003
, Predicates for line transversals in 3D, Accepted in Computational Geometry : Theory and Applications. (Also in Proceedings of 18th Canadian Conference on Computational Geometry -CCCG'06.), 2006.
URL : https://hal.archives-ouvertes.fr/inria-00103945
, Safey El Din. The voronoi diagram of three lines in R 3, Proceedings of the 23rd ACM Annual Symposium on Computational Geometry (SoCG'07), S. Korea, 2007.
, ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX, International Journal of Computational Geometry & Applications, vol.17, issue.04, pp.361-382, 2007.
DOI : 10.1142/S0218195907002380
URL : https://hal.archives-ouvertes.fr/inria-00103926
, Stabbing line segments, BIT, vol.2, issue.3, pp.274-281, 1982.
DOI : 10.1007/BF01934440
, Computing Voronoi skeletons of a 3-D polyhedron by space subdivision, Computational Geometry, vol.21, issue.3, pp.87-120, 2002.
DOI : 10.1016/S0925-7721(01)00056-6
, The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n???2, Discrete & Computational Geometry, vol.7, issue.1, pp.35-67, 1990.
DOI : 10.1007/BF02187778
, Comparing Real Algebraic Numbers of Small Degree, Proc. of European Symposium on Algorithms, pp.652-663, 2004.
DOI : 10.1007/978-3-540-30140-0_58
, über das Vorkommen definiter und semidefiniter Formen in Scharen quadratischer Formen, Comment. Math. Helv, vol.9, pp.188-192, 1936.
, Automatic parsing of degenerate quadric-surface intersections, ACM Transactions on Graphics, vol.8, issue.3, pp.174-203, 1989.
DOI : 10.1145/77055.77058
, Voronoi diagrams and delaunay triangulations In Handbook of discrete and computational geometry, pp.377-388, 1997.
, An upper bound on the average size of silhouettes, Proceedings of the twenty-second annual symposium on Computational geometry , SCG '06, 2006.
DOI : 10.1145/1137856.1137874
URL : https://hal.archives-ouvertes.fr/inria-00095282
, An upper bound on the average size of silhouettes, Proceedings of the twenty-second annual symposium on Computational geometry , SCG '06, 2007.
DOI : 10.1145/1137856.1137874
URL : https://hal.archives-ouvertes.fr/inria-00095282
, An exploration of the 3d visibility complex, 2007.
, An upper bound on the average size of silhouettes, Proceedings of the 22nd ACM Annual Symposium on Computational Geometry (SoCG'06), pp.105-111, 2006.
, Lower bounds on lines and line segments inn the presence of balls, 2007.
, Combining algebraic rigor with geometric robustness for the detection and calculation of conic sections in the intersection of two natural quadric surfaces, Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications , SMA '91, pp.221-231, 1991.
DOI : 10.1145/112515.112545
, The Free Software Foundation. http://www.swox.com/ gmp. [Goa04] X. Goaoc. Structures de visibilité globales : tailles, calculs et dégénérescences, Thèse d'université, 2004.
, Geometric transversal theory, Discrete and Computational Geometry, pp.163-198, 1993.
, Geometric transversal theory, Discrete and Computational Geometry, pp.163-198, 1993.
, Fast computation of generalized Voronoi diagrams using graphics hardware, Annual Conference Series) Proceedings of ACM SIGGRAPH, pp.277-286, 1999.
, Discontinuity meshing for radiosity, Proc. of Eurographics Workshop on Rendering, pp.203-216, 1992.
, Kinetic Visibility, 2002.
, Constructing convex hulls of quadratic surface patches, Proceedings of the 7th Canadian Conference on Computational Geometry (CCCG'95), pp.255-260, 1995.
, A Survey of Real-time Soft Shadows Algorithms, Proceedings of Eurographics'03, pp.753-774, 2003.
DOI : 10.1111/j.1467-8659.2003.00722.x
URL : https://hal.archives-ouvertes.fr/inria-00281388
, Maintenance de la visibilité depuis un point mobile, et applications, 2006.
, Methods of Algebraic Geometry, 1953.
, New bounds for lower envelopes in three dimensions, with applications to visibility in terrains, Discrete & Computational Geometry, vol.6, issue.3, pp.313-326, 1994.
DOI : 10.1007/BF02574383
, An Efficient Progressive Refinement Strategy for Hierarchical Radiosity, Proc. of 5th Eurographics Workshop on Rendering Photorealistic Rendering Techniques, Focus on Computer Graphics Series, pp.353-357, 1994.
DOI : 10.1007/978-3-642-87825-1_26
URL : https://hal.archives-ouvertes.fr/inria-00379411
, Determining the lines through four lines, Journal of Graphics Tools, vol.4, issue.3, pp.11-22, 1999.
, A developer's guide to silhouette algorithms for polygonal models, IEEE Comput. Graph. Appl, vol.23, issue.4, pp.28-37, 2003.
, A robust and efficient implementation for the segment voronoi diagram, International Symposium on Voronoi Diagrams in Science and Engineering, pp.51-62, 2004.
, ESOLID : A system for exact boundary evaluation, Computer-Aided Design, vol.36, issue.2, pp.175-193, 2004.
, Efficient and accurate B-rep generation of low degree sculptured solids using exact arithmetic: I???representations, Computer Aided Geometric Design, vol.16, issue.9, pp.841-859, 1999.
DOI : 10.1016/S0167-8396(99)00032-1
, The different ways of stabbing disjoint convex sets, Discrete & Computational Geometry, vol.5, issue.2, pp.197-206, 1992.
DOI : 10.1007/BF02187836
, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles, Discrete & Computational Geometry, vol.20, issue.1, pp.59-71, 1986.
DOI : 10.1007/BF02187683
, Semialgebraic Sard Theorem for Generalized Critical
Values, Journal of Differential Geometry, vol.56, issue.1, pp.67-92, 2000.
DOI : 10.4310/jdg/1090347525
, Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations, Proceedings of the eighteenth annual symposium on Computational geometry , SCG '02, pp.616-642, 2003.
DOI : 10.1145/513400.513427
, A Tight Bound on the Number of Geometric Permutations of Convex Fat Objects in R d, Discrete & Computational Geometry, vol.26, issue.4, pp.546-548, 2001.
DOI : 10.1007/s00454-001-0044-9
, Contour Edge Analysis for Polyhedron Projections, Geometric Modeling : Theory and Practice, pp.379-394, 1997.
DOI : 10.1007/978-3-642-60607-6_25
, The Algebraic Theory of Quadratic Forms, 1973.
, The visual hull concept for silhouette-based image understanding, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.16, issue.2, pp.150-162, 1994.
, La réalisation d'oeuvres d'art par prototypage rapide avec le procédé de Stratoconception, Thèse de doctorat, 2005.
, On the discriminant of real symmetric matrices. Communications on pure and applied mathematics [LED] LEDA : Library of Efficient Data Types and Algorithms, pp.11-121387, 1998.
, Mathematical models for determining the intersections of quadric surfaces [LiD] LiDIA : A C++ Library for Computational Number Theory Orientation des pièces artistiques pour le procédé de stratoconception Intersecting quadrics : An efficient and exact implementation, 10th European Forum on Rapid Prototyping Proceedings of the 20th ACM Annual Symposium on Computational GeometryLPP06] S. Lazard, L. M. Peñaranda, and S. Petitjean. Intersecting quadrics : An efficient and exact implementation . Computational Geometry : Theory and ApplicationsSpecial issue of the 20th ACM Symposium on Computational Geometry, pp.555-56373, 1976.
, Waterloo Maple Software An Introduction to Geometrical Probability : Distributional Aspects with Applications . Gordon and Breach Sciences Publishers Observations on silhouette sizes Visibilité 3D : calculs des segments libres tangents à des sphères unitaires. DEA, Université Henri Poincaré Nancy I Lines tangent to four unit spheres with coplanar centers Geometric algorithms for detecting and calculating all conic sections in the intersection of any two natural quadric surfaces Identification of algebraic numbers Geometric approaches to nonplanar quadric surface intersection curves Robust construction of the voronoi diagram of a polyhedron The perception of cast shadows Common tangents to four unit balls in R 3 The envelope of lines meeting a fixed line and tangent to two spheres Common transversals and tangents to two lines and two quadrics in P 3, Recent progress in exact geometric computation. J. of Logic and Algebraic Programming Proceedings of the 5th Canadian Conference on Computational Geometry (CCCG'93)MTT03] B. Mourrain, J.-P. Técourt, and M. Teillaud. Predicates for the sweeping of an arrangement of quadrics in 3D Effective Computational Geometry for Curves and Surfaces (European project), 2003. [MTT05] B. Mourrain, J.-P. Técourt, and M. Teillaud. On the computation of an arrangement of quadrics in 3D. Computational Geometry : Theory and Applications Special issue, 19th European Workshop on Computational Geometry, pp.85-1111, 1982.
, Geometry of Projective Algebraic Curves, 1984.
, Special issue on Visibility -Techniques and Applications Half-tone representation of 3D objects illuminated by area sources or polyhedron sources Spatial Tessellations -Concepts and Applications of Voronoi Diagrams Computational Geometry in C Radiosity for dynamic scenes in flatland with the visibility complex Precise implementation of CAD primitives using rational parametrization of standard surfaces Visibility, occlusion, and the aspect graph, IEEE Computer Society's 7th International Computer Software and Applications Conference (COMPSAC '83) Comput. Graph. Forum : Proceedings Eurographics'96 Planning, Geometry, and Complexity of Robot MotionPap91] A. Papoulis. Probability, Random Variables, and Stochastic ProcessesPel93] M. Pellegrini. Ray shooting on triangles in 3-space. AlgorithmicaPel94] M. Pellegrini. On lines missing polyhedral sets in 3-space. Discrete and Computational Geometry Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS'95), volume 900 of Lecture Notes in Computer Science, pp.655-666, 1983.
, Computing rational points on curves, Number Theory for the Millenium. A. K
, Finding stabbing lines in 3-space [PS03] P. Parillo and B. Sturmfels. Minimizing polynomial functions. In Algorithmic and quantitative real algebraic geometry, Proc. of Millennial Conference on Number TheoryPT06] S. Pion and M. Teillaud. 3d triangulations CGAL-3.2 User and Reference Manual. 2006. [PV96a] M. Pocchiola and G. Vegter. Topologically sweeping visibility complexes via pseudotriangulations . Discrete and Computational Geometry Proceedings of the 11th ACM Annual Symposium on Computational Geometry (SoCG'95), pp.191-208, 1992.
, The visibility complex, Proceedings of the 9th ACM Annual Symposium on Computational Geometry (SoCG'93), pp.279-308, 1996.
, Computational Line Geometry Mathematics and Visualization [RAG] RAG'Lib -A library for real algebraic geometry. M. Safey El Din Robust computation of the non-obstructed line segments tangent to four amongst n triangles, 2001.
, Dynamic visibility in polygonal scenes with the visibility complex, Proceedings of the 13th ACM Annual Symposium on Computational Geometry (SoCG'97), pp.421-423, 1997.
, Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation, Journal of Complexity, vol.16, issue.4, pp.716-750, 2000.
DOI : 10.1006/jcom.2000.0563
URL : https://hal.archives-ouvertes.fr/inria-00107845
, Efficient isolation of polynomial's real roots, Journal of Computational and Applied Mathematics, vol.162, issue.1, pp.33-50, 2004.
DOI : 10.1016/j.cam.2003.08.015
, Davenport-Schinzel Sequences and their Geometric Applications, 1995.
DOI : 10.1007/978-3-642-83539-1_9
URL : http://biogeometry.duke.edu/pubs-pankaj/surveys/ds-survey.ps.gz
, A Treatise on the Analytic Geometry of Three Dimensions, volume II, 1915.
, Integral Geometry and Geometric Probability, of Encyclopedia of Mathematics and its Applications, 1976.
, Algebraic methods for intersections of quadric surfaces in GMSOLID, Computer Vision, Graphics, and Image Processing, vol.22, pp.222-238, 1983.
, Sur une définition erronée de l'aire d'une surface courbe, Gesammelte Mathematische Abhandlungen, pp.309-311, 1890.
, When close enough is close enough, American Mathematical Monthly, vol.107, pp.489-499, 2000.
, Polar varieties and computation of at least one point in each connected component of a smooth real algebraic set, Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'03), pp.224-231, 2003.
, Properness defects of projections and computation of one point in each connected component of a real algebraic set, Discrete and Computational Geometry, vol.32, issue.3, pp.417-430, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00099962
, Studio sulle quadriche in uno spazio lineare ad un numero qualunque di dimensioni
, A convex hull algorithm optimal for point sets in even dimensions, 1981.
, A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons, Computational Geometry : Theory and Applications, vol.1, issue.1, pp.51-64, 1991.
, Fast computation of shadow boundaries using spatial coherence and backprojections, Proceedings of the 21st annual conference on Computer graphics and interactive techniques , SIGGRAPH '94, pp.231-238, 1994.
DOI : 10.1145/192161.192210
, A Software for Interactive Modeling, Simulation and Visualization of Complex 3D Scenes
, Silhouette clipping, SIGGRAPH '00 : Proceedings of the 27th annual conference on Computer graphics and interactive techniques, pp.327-334, 2000.
, Almost tight upper bounds for lower envelopes in higher dimensions, Discrete and Computational Geometry, vol.12, pp.327-345, 1994.
, Plücker coordinate tutorial, Ray Tracing News, vol.11, issue.1, 1998.
, Computing the intersection of a plane and a natural quadric, Shene and J. Johnstone. On the lower degree intersections of two natural quadrics, pp.179-186400, 1992.
, The Algorithm Design Manual Mathematics and Visualization Worst-case versus average case complexity of ray-shooting Sharp bounds on geometric permutations for pairwise disjoint balls in R d [SOS] SOSTOOLS -A MATLAB toolbox for sums of squares optimization programs Vertical decomposition of a single cell in a three-dimensional arrangement of surfaces and its applications Oriented Projective Geometry : A Framework for Geometric Computations How to make geometric algorithms robust, Proceedings of the Spring Conference on Computer GraphicsSur] Surf : A Tool To Visualize Algebraic Curves and Surfacessurf.sourceforge.net. [SW06] E. Schömer and N. Wolpert. An exact and efficient approach for computing a cell in an arrangement of quadrics. Computational Geometry : Theory and Applications Special Issue on Robust Geometric Algorithms and their Implementations. [Tel92] S. J. Teller. Computing the antipenumbra of an area light source. In Computer Graphics Proceedings , Annual Conference Series, Annual Conference Series, ACM SIGGRAPH, pp.89-98247, 1991.
, New algebraic methods in computational geometry. Habilitationsschrift An enumerative geometry framework for algorithmic line problems in R 3 Teichmann and S. Teller. Polygonal approximation of voronoi diagrams of a set of triangles in three dimensions, SIAM Journal on Computing Laboratory of Computer Science, vol.31, pp.1212-1228, 1992.
, Signature sequence of intersection curve of two quadrics for exact morphological classification Classifying the nonsingular intersection curve of two quadric surfaces Simultaneous block diagonalization of two real symmetric matrices A canonical form for a pair of real symmetric matrices that generate a nonsingular pencil The effect of shadow quality on the perception of spatial relationships in computer generated images, Proc. of GMP'02 (Geometric Modeling and Processing)Wan92] L. Wanger, pp.23-32281, 1973.
, Zur Theorie der bilinearen und quadratischen Formen, Monatshefte Akademie der Wissenschaften, pp.310-338, 1868.
, Upper bounds on geometric permutations for convex sets, Discrete Comput. Geom, vol.5, pp.27-33, 1990.
, Progress in geometric transversal theory, Advances in Discrete and Computational Geometry, pp.375-393, 1998.
, Enhancing Levin's method for computing quadric-surface intersections, Computer Aided Geometric Design, vol.20, issue.7, pp.401-422, 2003.
DOI : 10.1016/S0167-8396(03)00081-5
, Rational Quadratic Parameterizations of Quadrics, International Journal of Computational Geometry & Applications, vol.07, issue.06, pp.599-619, 1997.
DOI : 10.1142/S0218195997000375
, Computing quadric surface intersections based on an analysis of plane cubic curves, Graphical Models, vol.64, issue.6, pp.335-367, 2002.
DOI : 10.1016/S1077-3169(02)00018-7
, Interference analysis of conics and quadrics, Topics in Algebraic Geometry and Geometric Modeling : Workshop on Algebraic Geometry and Geometric Modeling, pp.25-36, 2002.
DOI : 10.1090/conm/334/05973
, Quadric-surface intersection curves: shape and structure, Computer-Aided Design, vol.25, issue.10, pp.633-643, 1993.
DOI : 10.1016/0010-4485(93)90018-J
, A survey of shadow algorithms, IEEE Computer Graphics and Applications, vol.10, issue.6, pp.13-32, 1990.
DOI : 10.1109/38.62693
, Planar realizations of nonlinear davenport-schinzel sequences by segments, Discrete & Computational Geometry, vol.25, issue.1, pp.15-47, 1988.
DOI : 10.1007/BF02187894
, An algebraic condition for the separation of two ellipsoids, Computer Aided Geometric Design, vol.18, issue.6, pp.531-539, 2001.
DOI : 10.1016/S0167-8396(01)00049-8
, Towards exact geometric computation, Computational Geometry, vol.7, issue.1-2, pp.3-23, 1997.
DOI : 10.1016/0925-7721(95)00040-2
, Towards an implementation of the 3D visibility skeleton, Proceedings of the twenty-third annual symposium on Computational geometry , SCG '07, 2007.
DOI : 10.1145/1247069.1247094
URL : https://hal.archives-ouvertes.fr/inria-00338095