Result: Scalar Tagged PN Triangles

Title:
Scalar Tagged PN Triangles
Contributors:
Visualization and manipulation of complex data on wireless mobile devices (IPARLA), INRIA Futurs, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Sciences et Technologies - Bordeaux 1 (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)
Source:
EUROGRAPHICS Short Papers, Sep 2005, Dunblin, Ireland
Publisher Information:
CCSD, 2005.
Publication Year:
2005
Collection:
collection:CNRS
collection:INRIA
collection:ENSEIRB
collection:INRIA-FUTURS
collection:LABRI
collection:UNIV-BORDEAUX
collection:TESTALAIN1
collection:TESTBORDEAUX
collection:INRIA2
collection:UNIVERSITE-BORDEAUX
Subject Geographic:
Original Identifier:
HAL:
Document Type:
Conference conferenceObject<br />Conference papers
Language:
English
Rights:
info:eu-repo/semantics/OpenAccess
Accession Number:
edshal.inria.00260902v1
Database:
HAL

Further Information

This paper presents a new technique to convert a coarse polygonal geometric model into a smooth surface interpolating the mesh vertices, by improving the principle proposed by Vlachos et al. in their "Curved PN-Triangles". The key idea is to assign to each mesh vertex, a set of three scalar tags that act as shape controllers. These scalar tags (called sharpness, bias, and tension) are used to compute a procedural displacement map that enriches the geometry, and a procedural normal map that enriches the shading. The resulting technique offers two majors features: first, it can be applied on meshes of arbitrary topology while always generating surfaces with consistent behaviors across edge and vertex boundaries, second, it only involves operations that are purely local to each polygon, which means that it is very well suited for hardware implementations.