Fast Neighborhood Search on Polygonal Meshes

Simple item page
dc.contributor.authorRocca, Luigien_US
dc.contributor.authorGiorgis, Nikolas Deen_US
dc.contributor.authorPanozzo, Danieleen_US
dc.contributor.authorPuppo, Enricoen_US
dc.contributor.editorAndrea F. Abate and Michele Nappi and Genny Tortoraen_US
dc.date.accessioned2013-10-31T09:24:44Z
dc.date.available2013-10-31T09:24:44Z
dc.date.issued2011en_US
dc.description.abstractWe introduce a spatial index to support the fast retrieval of large neighborhoods of points on a polygonal mesh. Our spatial index can be computed efficiently off-line, introducing a negligible overhead over a standard indexed data structure. In retrieving neighborhoods of points on-line, we achieve a speed-up of about one order of magnitude with respect to standard topological traversal, while obtaining much more accurate results than straight 3D range search. We provide quantitative comparisons of results obtained with our method with respect to known techniques.en_US
dc.description.seriesinformationEurographics Italian Chapter Conference 2011en_US
dc.identifier.isbn978-3-905673-88-3en_US
dc.identifier.urihttps://doi.org/10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2011/015-021en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling-Curve, surface, solid, and object representations I.3.6 [Computer Graphics]: Methodology and techniques-Graphics data structures and data typesen_US
dc.titleFast Neighborhood Search on Polygonal Meshesen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
015-021.pdf
Size:
559.33 KB
Format:
Adobe Portable Document Format
Download
Collections
Italian Chapter Conference 2011