Computing Smooth Surface Contours with Accurate Topology
| hal.structure.identifier | Dynamic Graphics Project [Toronto] [DGP] | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| hal.structure.identifier | Melting the frontiers between Light, Shape and Matter [MANAO] | |
| dc.contributor.author | BÉNARD, Pierre | |
| hal.structure.identifier | Dynamic Graphics Project [Toronto] [DGP] | |
| hal.structure.identifier | Pixar Animation Studios | |
| hal.structure.identifier | Adobe Systems Inc. [Adobe Advanced Technology Labs] | |
| dc.contributor.author | HERTZMANN, Aaron | |
| hal.structure.identifier | Pixar Animation Studios | |
| dc.contributor.author | KASS, Michael | |
| dc.date.accessioned | 2023-05-12T10:20:27Z | |
| dc.date.available | 2023-05-12T10:20:27Z | |
| dc.date.issued | 2014 | |
| dc.identifier.issn | 0730-0301 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/181074 | |
| dc.description.abstractEn | This paper 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 approach is to generate, for each viewpoint, a new triangle mesh with contours that are topologically-equivalent and geometrically close to those of the original smooth surface. The contours of the mesh can then be rendered with exact visibility. The core of the approach is Contour-Consistency, a way to prove topological equivalence between the contours of two surfaces. Producing a surface tessellation that satisfies this property is itself challenging; to this end, we introduce a type of triangle that ensures consistency at the contour. We then introduce an iterative mesh generation procedure, based on these ideas. This procedure does not fully guarantee consistency, but errors are not noticeable in our experiments. Our algorithm can operate on any smooth input surface representation; we use Catmull-Clark subdivision surfaces in our implementation. We demonstrate results computing contours of complex 3D objects, on which our method eliminates the contour artifacts of other methods. | |
| dc.language.iso | en | |
| dc.publisher | Association for Computing Machinery | |
| dc.subject.en | non-photorealistic rendering | |
| dc.subject.en | line drawing | |
| dc.subject.en | silhouettes | |
| dc.subject.en | visibility | |
| dc.subject.en | geometry processing | |
| dc.title.en | Computing Smooth Surface Contours with Accurate Topology | |
| dc.type | Article de revue | |
| dc.identifier.doi | 10.1145/2558307 | |
| dc.subject.hal | Informatique [cs]/Synthèse d'image et réalité virtuelle [cs.GR] | |
| bordeaux.journal | ACM Transactions on Graphics | |
| bordeaux.volume | 33 | |
| bordeaux.hal.laboratories | Laboratoire Photonique, Numérique et Nanosciences (LP2N) - UMR 5298 | * |
| bordeaux.issue | 2 | |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | CNRS | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00924273 | |
| hal.version | 1 | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00924273v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=ACM%20Transactions%20on%20Graphics&rft.date=2014&rft.volume=33&rft.issue=2&rft.eissn=0730-0301&rft.issn=0730-0301&rft.au=B%C3%89NARD,%20Pierre&HERTZMANN,%20Aaron&KASS,%20Michael&rft.genre=article |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||