Skip to Main content Skip to Navigation

Triangulations et quadriques

Pascal Desnogues 1
1 PRISME - Geometry, Algorithms and Robotics
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : Given a set S of data points on a surface F whose equation is z = f(x,y), we would like to triangulate the convex hull of the projection of F on the xy-plane. This triangulation determines a linear approximation of F whose quality is given by a measure of the approximation error. It has been recently proved that the Delaunay triangulation is optimal with respect to Lp-norm criteria, when used for approximating convex quadratic functions. But, little research has been carried out for non convex surfaces. This work studies the approximation, with respect to L1- and L2-norms, of a non convex surface by using a triangulation. We consider a simple case: the hyperbolic paraboloid z = x2 − y2. A construction is given for finding the separation curves of a triangle ∆, the curves limiting the planar zones where ∆ will be kept in a locally optimal triangulation of the hyperbolic paraboloid. Triangu- lation algorithms that use several heuristics based on the separation curves are amply tested and are shown to be better than the Delaunay triangulation. A comparison with globally optimal triangulations which are obtained by means of exponential programs shows that these algorithms finally give "good" trian- gulations. Our research proves that such a process can be easily extended to general quadratic functions z = αx2 + βy2 + γxy + δ1x + δ2y + δ3.
Document type :
Complete list of metadata
Contributor : Olivier Devillers <>
Submitted on : Tuesday, January 8, 2013 - 2:50:06 PM
Last modification on : Saturday, January 27, 2018 - 1:30:52 AM
Long-term archiving on: : Tuesday, April 9, 2013 - 3:52:57 AM


  • HAL Id : tel-00771335, version 1



Pascal Desnogues. Triangulations et quadriques. Géométrie algorithmique [cs.CG]. Université Nice Sophia Antipolis, 1996. Français. ⟨tel-00771335⟩



Record views


Files downloads