Primitive trees for precomputed distance queries

Sung Ho Lee, Taejung Park, Chang-Hun Kim

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

We propose the primitive tree, a novel and compact space-partition method that samples and reconstructs a distance field with high accuracy, even for regions far from the surfaces. The primitive tree is based on the octree and stores the indices of the nearest primitives in its leaf nodes. Most previous approaches have involved a trade-off between accuracy and speed in distance queries, but our method can improve both aspects simultaneously. In addition, our method can sample unsigned distance fields effectively, even for self-intersecting and nonmanifold models. We present test results showing that our method can sample and represent large scenes, with more than ten million triangles, rapidly and accurately.

Original languageEnglish
Pages (from-to)419-428
Number of pages10
JournalComputer Graphics Forum
Volume32
Issue number2 PART4
DOIs
Publication statusPublished - 2013 May 1

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Primitive trees for precomputed distance queries. / Lee, Sung Ho; Park, Taejung; Kim, Chang-Hun.

In: Computer Graphics Forum, Vol. 32, No. 2 PART4, 01.05.2013, p. 419-428.

Research output: Contribution to journalArticle

Lee, Sung Ho ; Park, Taejung ; Kim, Chang-Hun. / Primitive trees for precomputed distance queries. In: Computer Graphics Forum. 2013 ; Vol. 32, No. 2 PART4. pp. 419-428.
@article{55f95aacaff44a2ebf7aee4fdf45fdb3,
title = "Primitive trees for precomputed distance queries",
abstract = "We propose the primitive tree, a novel and compact space-partition method that samples and reconstructs a distance field with high accuracy, even for regions far from the surfaces. The primitive tree is based on the octree and stores the indices of the nearest primitives in its leaf nodes. Most previous approaches have involved a trade-off between accuracy and speed in distance queries, but our method can improve both aspects simultaneously. In addition, our method can sample unsigned distance fields effectively, even for self-intersecting and nonmanifold models. We present test results showing that our method can sample and represent large scenes, with more than ten million triangles, rapidly and accurately.",
author = "Lee, {Sung Ho} and Taejung Park and Chang-Hun Kim",
year = "2013",
month = "5",
day = "1",
doi = "10.1111/cgf.12062",
language = "English",
volume = "32",
pages = "419--428",
journal = "Computer Graphics Forum",
issn = "0167-7055",
publisher = "Wiley-Blackwell",
number = "2 PART4",

}

TY - JOUR

T1 - Primitive trees for precomputed distance queries

AU - Lee, Sung Ho

AU - Park, Taejung

AU - Kim, Chang-Hun

PY - 2013/5/1

Y1 - 2013/5/1

N2 - We propose the primitive tree, a novel and compact space-partition method that samples and reconstructs a distance field with high accuracy, even for regions far from the surfaces. The primitive tree is based on the octree and stores the indices of the nearest primitives in its leaf nodes. Most previous approaches have involved a trade-off between accuracy and speed in distance queries, but our method can improve both aspects simultaneously. In addition, our method can sample unsigned distance fields effectively, even for self-intersecting and nonmanifold models. We present test results showing that our method can sample and represent large scenes, with more than ten million triangles, rapidly and accurately.

AB - We propose the primitive tree, a novel and compact space-partition method that samples and reconstructs a distance field with high accuracy, even for regions far from the surfaces. The primitive tree is based on the octree and stores the indices of the nearest primitives in its leaf nodes. Most previous approaches have involved a trade-off between accuracy and speed in distance queries, but our method can improve both aspects simultaneously. In addition, our method can sample unsigned distance fields effectively, even for self-intersecting and nonmanifold models. We present test results showing that our method can sample and represent large scenes, with more than ten million triangles, rapidly and accurately.

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

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

U2 - 10.1111/cgf.12062

DO - 10.1111/cgf.12062

M3 - Article

AN - SCOPUS:84877595672

VL - 32

SP - 419

EP - 428

JO - Computer Graphics Forum

JF - Computer Graphics Forum

SN - 0167-7055

IS - 2 PART4

ER -