Fast neighborhood search on polygonal meshes

L. Rocca, N. De Giorgis, Daniele Panozzo, E. Puppo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We 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 methodwith respect to known techniques.

Original languageEnglish (US)
Title of host publicationEurographics Italian Chapter Conference 2011
Pages15-21
Number of pages7
DOIs
StatePublished - 2011
Event9th Eurographics Italian Chapter Conference 2011 - Salerno, Italy
Duration: Nov 24 2011Nov 25 2011

Other

Other9th Eurographics Italian Chapter Conference 2011
CountryItaly
CitySalerno
Period11/24/1111/25/11

Fingerprint

Data structures

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design

Cite this

Rocca, L., De Giorgis, N., Panozzo, D., & Puppo, E. (2011). Fast neighborhood search on polygonal meshes. In Eurographics Italian Chapter Conference 2011 (pp. 15-21) https://doi.org/10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2011/015-021

Fast neighborhood search on polygonal meshes. / Rocca, L.; De Giorgis, N.; Panozzo, Daniele; Puppo, E.

Eurographics Italian Chapter Conference 2011. 2011. p. 15-21.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Rocca, L, De Giorgis, N, Panozzo, D & Puppo, E 2011, Fast neighborhood search on polygonal meshes. in Eurographics Italian Chapter Conference 2011. pp. 15-21, 9th Eurographics Italian Chapter Conference 2011, Salerno, Italy, 11/24/11. https://doi.org/10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2011/015-021
Rocca L, De Giorgis N, Panozzo D, Puppo E. Fast neighborhood search on polygonal meshes. In Eurographics Italian Chapter Conference 2011. 2011. p. 15-21 https://doi.org/10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2011/015-021
Rocca, L. ; De Giorgis, N. ; Panozzo, Daniele ; Puppo, E. / Fast neighborhood search on polygonal meshes. Eurographics Italian Chapter Conference 2011. 2011. pp. 15-21
@inproceedings{2ee1abb6bb7945fd8399d81765a5f6fe,
title = "Fast neighborhood search on polygonal meshes",
abstract = "We 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 methodwith respect to known techniques.",
author = "L. Rocca and {De Giorgis}, N. and Daniele Panozzo and E. Puppo",
year = "2011",
doi = "10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2011/015-021",
language = "English (US)",
isbn = "9783905673883",
pages = "15--21",
booktitle = "Eurographics Italian Chapter Conference 2011",

}

TY - GEN

T1 - Fast neighborhood search on polygonal meshes

AU - Rocca, L.

AU - De Giorgis, N.

AU - Panozzo, Daniele

AU - Puppo, E.

PY - 2011

Y1 - 2011

N2 - We 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 methodwith respect to known techniques.

AB - We 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 methodwith respect to known techniques.

UR - http://www.scopus.com/inward/record.url?scp=84883235760&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84883235760&partnerID=8YFLogxK

U2 - 10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2011/015-021

DO - 10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2011/015-021

M3 - Conference contribution

SN - 9783905673883

SP - 15

EP - 21

BT - Eurographics Italian Chapter Conference 2011

ER -