Surface reconstruction based on lower dimensional localized Delaunay triangulation

M. Gopi, S. Krishnan, C. T. Silva

Research output: Contribution to journalArticle

Abstract

We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P ⊃ R3. Nothing is assumed about the geometry, topology or presence of boundaries in the data set except that P is sampled from a real manifold surface. The speed of our algorithm is derived from a projection-based approach we use to determine the incident faces on a point. We define our sampling criteria to sample the surface and guarantee a topologically correct mesh after surface reconstruction for such a sampled surface. We also present a new algorithm to find the normal at a vertex, when the surface is sampled according our given criteria. We also present results of our surface reconstruction using our algorithm on unorganized point clouds of various models.

Original languageEnglish (US)
JournalComputer Graphics Forum
Volume19
Issue number3
StatePublished - Aug 21 2000

Fingerprint

Surface reconstruction
Triangulation
Topology
Sampling
Data storage equipment
Geometry

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

Surface reconstruction based on lower dimensional localized Delaunay triangulation. / Gopi, M.; Krishnan, S.; Silva, C. T.

In: Computer Graphics Forum, Vol. 19, No. 3, 21.08.2000.

Research output: Contribution to journalArticle

@article{cf5ed819147c4992b4b7fb89523bcbcb,
title = "Surface reconstruction based on lower dimensional localized Delaunay triangulation",
abstract = "We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P ⊃ R3. Nothing is assumed about the geometry, topology or presence of boundaries in the data set except that P is sampled from a real manifold surface. The speed of our algorithm is derived from a projection-based approach we use to determine the incident faces on a point. We define our sampling criteria to sample the surface and guarantee a topologically correct mesh after surface reconstruction for such a sampled surface. We also present a new algorithm to find the normal at a vertex, when the surface is sampled according our given criteria. We also present results of our surface reconstruction using our algorithm on unorganized point clouds of various models.",
author = "M. Gopi and S. Krishnan and Silva, {C. T.}",
year = "2000",
month = "8",
day = "21",
language = "English (US)",
volume = "19",
journal = "Computer Graphics Forum",
issn = "0167-7055",
publisher = "Wiley-Blackwell",
number = "3",

}

TY - JOUR

T1 - Surface reconstruction based on lower dimensional localized Delaunay triangulation

AU - Gopi, M.

AU - Krishnan, S.

AU - Silva, C. T.

PY - 2000/8/21

Y1 - 2000/8/21

N2 - We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P ⊃ R3. Nothing is assumed about the geometry, topology or presence of boundaries in the data set except that P is sampled from a real manifold surface. The speed of our algorithm is derived from a projection-based approach we use to determine the incident faces on a point. We define our sampling criteria to sample the surface and guarantee a topologically correct mesh after surface reconstruction for such a sampled surface. We also present a new algorithm to find the normal at a vertex, when the surface is sampled according our given criteria. We also present results of our surface reconstruction using our algorithm on unorganized point clouds of various models.

AB - We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P ⊃ R3. Nothing is assumed about the geometry, topology or presence of boundaries in the data set except that P is sampled from a real manifold surface. The speed of our algorithm is derived from a projection-based approach we use to determine the incident faces on a point. We define our sampling criteria to sample the surface and guarantee a topologically correct mesh after surface reconstruction for such a sampled surface. We also present a new algorithm to find the normal at a vertex, when the surface is sampled according our given criteria. We also present results of our surface reconstruction using our algorithm on unorganized point clouds of various models.

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

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

M3 - Article

VL - 19

JO - Computer Graphics Forum

JF - Computer Graphics Forum

SN - 0167-7055

IS - 3

ER -