Feature-based surface parameterization and texture mapping
TL;DR: An automatic parameterization method for segmenting a surface into patches that are then flattened with little stretch, and an image-based error measure that takes into account stretch, seams, smoothness, packing efficiency, and surface visibility is described.
read more
Abstract: Surface parameterization is necessary for many graphics tasks: texture-preserving simplification, remeshing, surface painting, and precomputation of solid textures. The stretch caused by a given parameterization determines the sampling rate on the surface. In this article, we present an automatic parameterization method for segmenting a surface into patches that are then flattened with little stretch.Many objects consist of regions of relatively simple shapes, each of which has a natural parameterization. Based on this observation, we describe a three-stage feature-based patch creation method for manifold surfaces. The first two stages, genus reduction and feature identification, are performed with the help of distance-based surface functions. In the last stage, we create one or two patches for each feature region based on a covariance matrix of the feature's surface points.To reduce stretch during patch unfolding, we notice that stretch is a 2 × 2 tensor, which in ideal situations is the identity. Therefore, we use the Green-Lagrange tensor to measure and to guide the optimization process. Furthermore, we allow the boundary vertices of a patch to be optimized by adding scaffold triangles. We demonstrate our feature-based patch creation and patch unfolding methods for several textured models.Finally, to evaluate the quality of a given parameterization, we describe an image-based error measure that takes into account stretch, seams, smoothness, packing efficiency, and surface visibility.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Learning 3D mesh segmentation and labeling
Evangelos Kalogerakis,Aaron Hertzmann,Karan Singh +2 more
- 26 Jul 2010
TL;DR: This paper presents a data-driven approach to simultaneous segmentation and labeling of parts in 3D meshes, formulated as a Conditional Random Field model, with terms assessing the consistency of faces with labels, and terms between labels of neighboring faces.
PointGrid: A Deep Network for 3D Shape Understanding
TL;DR: The PointGrid is proposed, a 3D convolutional network that incorporates a constant number of points within each grid cell thus allowing the network to learn higher order local approximation functions that could better represent the local geometry shape details.
A local/global approach to mesh parameterization
Ligang Liu,Lei Zhang,Yin Xu,Craig Gotsman,Steven J. Gortler +4 more
- 02 Jul 2008
TL;DR: A local/global algorithm, which combines a local mapping of each 3D triangle to the plane, using transformations taken from a restricted set, with a global “stitch” operation of all triangles, involving a sparse linear system.
Mesh segmentation using feature point and core extraction
TL;DR: A novel hierarchical mesh segmentation algorithm, which is based on new methods for prominent feature point and core extraction, which produces correct hierarchical segmentations of meshes, both in the coarse levels of the hierarchy and in the fine levels, where tiny segments are extracted.
References
OBBTree: a hierarchical structure for rapid interference detection
Stefan Gottschalk,Ming C. Lin,Dinesh Manocha +2 more
- 01 Aug 1996
TL;DR: A data structure and an algorithm for efficient and exact interference detection amongst complex models undergoing rigid motion that can robustly and accurately detect all the contacts between large complex geometries composed of hundreds of thousands of polygons at interactive rates are presented.
An image synthesizer
Ken Perlin
- 01 Jul 1985
TL;DR: The concept of "solid texture" to the field of CGI is introduced and used to create very convincing representations of clouds, fire, water, stars, marble, wood, rock, soap films and crystal.
2K
Multiresolution analysis of arbitrary meshes
Matthias Eck,Tony DeRose,Tom Duchamp,Hugues Hoppe,Michael Lounsbery,Werner Stuetzle +5 more
- 15 Sep 1995
TL;DR: A method for overcoming the subdivision connectivity restriction, meaning that completely arbitrary meshes can now be converted to multiresolution form, is presented, based on the approximation of an arbitrary initial mesh M by a mesh MJ that has subdivision connectivity and is guaranteed to be within a specified tolerance.
Least squares conformal maps for automatic texture atlas generation
Bruno Levy,Sylvain Petitjean,Nicolas Ray,Jerome Maillot +3 more
- 01 Jul 2002
TL;DR: This paper introduces a new quasi-conformal parameterization method, based on a least-squares approximation of the Cauchy-Riemann equations, which can parameterize large charts with complex borders, and introduces segmentation methods to decompose the model into charts with natural shapes, and a new packing algorithm to gather them in texture space.
Computing geodesic paths on manifolds
Ron Kimmel,James A. Sethian +1 more
TL;DR: The Fast Marching Method is extended to triangulated domains with the same computational complexity and is provided as an optimal time algorithm for computing the geodesic distances and thereby extracting shortest paths on triangulate manifolds.
Related Papers (5)
Pedro V. Sander,John Snyder,Steven J. Gortler,Hugues Hoppe +3 more
- 01 Aug 2001
Michael S. Floater,Kai Hormann +1 more
- 01 Jan 2005