Constriction Computation using Surface Curvature

Simple item page
dc.contributor.authorHétroy, F.en_US
dc.contributor.editorJohn Dingliana and Fabio Ganovellien_US
dc.date.accessioned2015-07-19T16:44:58Z
dc.date.available2015-07-19T16:44:58Z
dc.date.issued2005en_US
dc.description.abstractThis paper provides a curvature-based algorithm to compute locally shortest geodesics on closed triangulated surfaces. These curves, which are called "constrictions", are useful for shape segmentation. The key idea of the algorithm is that constrictions are almost plane curves; it first finds well-located simple, plane, closed curves, and then slides them along the surface until a shortest geodesic is reached. An initial curve is defined as a connected component of the intersection between the surface and a plane going through an initial vertex. Initial vertices and planes are determined using approximations of surface curvature.en_US
dc.description.sectionheadersMeshesen_US
dc.description.seriesinformationEG Short Presentationsen_US
dc.identifier.doi10.2312/egs.20051009en_US
dc.identifier.pages1-4en_US
dc.identifier.urihttps://doi.org/10.2312/egs.20051009en_US
dc.publisherThe Eurographics Associationen_US
dc.titleConstriction Computation using Surface Curvatureen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
001-004.pdf
Size:
9.68 MB
Format:
Adobe Portable Document Format
Download
Collections
Short Presentations 2005