ConTesse: Accurate Occluding Contours for Subdivision Surfaces
Open Access
- 19 January 2023
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 42 (1), 1-16
- https://doi.org/10.1145/3544778
Abstract
This paper proposes a method for computing the visible occluding contours of subdivision surfaces. The paper first introduces new theory for contour visibility of smooth surfaces. Necessary and sufficient conditions are introduced for when a sampled occluding contour is valid, that is, when it may be assigned consistent visibility. Previous methods do not guarantee these conditions, which helps explain why smooth contour visibility has been such a challenging problem in the past. The paper then proposes an algorithm that, given a subdivision surface, finds sampled contours satisfying these conditions, and then generates a new triangle mesh matching the given occluding contours. The contours of the output triangle mesh may then be rendered with standard non-photorealistic rendering algorithms, using the mesh for visibility computation. The method can be applied to any triangle mesh, by treating it as the base mesh of a subdivision surface.Keywords
Funding Information
- ANR MoStyle (ANR-20-CE33-0002)
This publication has 20 references indexed in Scilit:
- Locally injective parametrization with arbitrary fixed boundariesACM Transactions on Graphics, 2014
- Computing smooth surface contours with accurate topologyACM Transactions on Graphics, 2014
- Consistent Volumetric Discretizations Inside Self‐Intersecting SurfacesComputer Graphics Forum, 2013
- Snaxels on a planePublished by Association for Computing Machinery (ACM) ,2011
- Programmable rendering of line drawing from 3D scenesACM Transactions on Graphics, 2010
- Where do people draw lines?ACM Transactions on Graphics, 2008
- Exact Evaluation of Catmull-Clark Subdivision Surfaces Near B-Spline BoundariesJournal of Graphics Tools, 2007
- Detecting and decomposing self-overlapping curvesComputational Geometry, 1992
- Constrained delaunay triangulationsAlgorithmica, 1989
- BE VISION, A Package of IBM 7090 FORTRAN Programs to Draw Orthographic Views of Combinations of Plane and Quadric SurfacesJournal of the ACM, 1966