Chenxi Liu
Abstract
This article proposes a method for computing the visible occluding contours of subdivision surfaces. The article 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 article 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.
- . 1967. The notion of quantitative invisibility and the machine rendering of solids. In Proceedings of the 1967 22nd National Conference.ACM, 387–393.
DOI: Google Scholar
Digital Library
- . 2019. Line drawings from 3D models. Foundations and Trends in Computer Graphics and Vision 11, 1–2 (2019), 1–159.
DOI: Google ScholarDigital Library - . 2014. Computing smooth surface contours with accurate topology. ACM Transactions on Graphics 33, 2, 21 pages.
DOI: Google ScholarDigital Library - . 1989. Constrained delaunay triangulations. Algorithmica 4, 1(1989), 97–108.
DOI: Google ScholarDigital Library - . 2010. Two fast methods for high-quality line visibility. IEEE Transactions on Visualization and Computer Graphics 16, 5 (2010), 707–717.
DOI: Google ScholarDigital Library - . 2008. Where do people draw lines? ACM Transactions on Graphics 27, 3, 11 pages.
DOI: Google ScholarDigital Library - . 2008. Stylized vector art from 3D models with region support. In Proceedings of the 19th Eurographics Conference on Rendering.Eurographics Association, 1199–1207.
DOI: Google ScholarDigital Library - . 1990. Hidden curve removal for free form surfaces. In Proceedings of the 17th Annual Conference on Computer Graphics and Interactive Techniques.ACM, 95–104.
DOI: Google ScholarDigital Library - . 2009. Self-overlapping curves revisited. In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms.SIAM, 160–169.Google ScholarCross Ref
- . 2010. Programmable rendering of line drawing from 3D scenes. ACM Transactions on Graphics 29, 2 (2010), 20 pages.
DOI: Google ScholarDigital Library - . 2002. Geometry images. ACM Transactions on Graphics 21, 3 (2002), 355–361.
DOI: Google ScholarDigital Library - . 2000. Illustrating smooth surfaces. In Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques.517–526.
DOI: Google ScholarDigital Library - . 2006. SmoothSketch: 3D free-form shapes from complex sketches. In Proceedings of the ACM SIGGRAPH 2006 Papers.Association for Computing Machinery, New York, NY, 589–598.
DOI: Google ScholarDigital Library - . 2011. Snaxels on a plane. In Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Non-Photorealistic Animation and Rendering.ACM, 35–42.
DOI: Google ScholarDigital Library - . 2007. Exact evaluation of catmull-clark subdivision surfaces near B-Spline boundaries. Journal of Graphics Tools 12, 3 (2007), 7–15.Google ScholarCross Ref
- . 2018. Immersion of self-intersecting solids and surfaces. ACM Transactions on Graphics 37, 4 (2018), 14 pages.
DOI: Google ScholarDigital Library - . 1997. Real-time nonphotorealistic rendering. In Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques.415–420.
DOI: Google ScholarDigital Library - . 2000. Artistic silhouettes: A hybrid approach. In Proceedings of the 1st International Symposium on Non-photorealistic Animation and Rendering.ACM, 31–37.
DOI: Google ScholarDigital Library - . 1963. Machine Perception of Three-dimensional Solids. Ph. D. Dissertation. Massachusetts Institute of Technology. Dept. of Electrical Engineering.Google Scholar
- . 2013. Consistent volumetric discretizations inside self-intersecting surfaces. Computer Graphics Forum 32, 5 (2013), 147–156.Google ScholarDigital Library
- . 1990. Comprehensible rendering of 3-D shapes. In Proceedings of the 17th Annual Conference on Computer Graphics and Interactive Techniques.ACM, 197–206.
DOI: Google ScholarDigital Library - . 1992. Detecting and decomposing self-overlapping curves. Computational Geometry 2, 1(1992), 31–50.
DOI: Google ScholarDigital Library - . 2014. Locally injective parametrization with arbitrary fixed boundaries. ACM Transactions on Graphics 33, 4 (2014).
DOI: Google ScholarDigital Library - . 1966. BE VISION, A package of IBM 7090 FORTRAN programs to draw orthographic views of combinations of plane and quadric surfaces. Journal of the ACM 13, 2 (1966), 194–204.
DOI: Google ScholarDigital Library - . 1994. Computer-generated pen-and-ink illustration. In Proceedings of the 21st Annual Conference on Computer Graphics and Interactive Techniques.ACM, 91–100.
DOI: Google ScholarDigital Library - . 1996. Rendering parametric surfaces in pen and ink. In Proceedings of the 23rd Annual Conference on Computer Graphics and Interactive Techniques.ACM, 469–476.
DOI: Google ScholarDigital Library
Index Terms
- ConTesse: Accurate Occluding Contours for Subdivision Surfaces
Recommendations
Computing smooth surface contours with accurate topology
This article introduces a method for accurately computing the visible contours of a smooth 3D surface for stylization. This is a surprisingly difficult problem, and previous methods are prone to topological errors, such as gaps in the outline. Our ...
Algebraic Smooth Occluding Contours
SIGGRAPH '23: ACM SIGGRAPH 2023 Conference ProceedingsComputing occluding contours is a key step in 3D non-photorealistic rendering, but producing smooth contours with consistent visibility has been a notoriously-challenging open problem. This paper describes the first general-purpose smooth surface ...
Polygonal silhouette error correction: a reverse subdivision approach
A method for automatic removal of artifacts and errors that can appear in silhouettes extracted from polygonal meshes is presented and evaluated. These errors typically appear in polygonal silhouettes due to the discrete nature of meshes and numerical ...
Comments