Primitive trees for precomputed distance queries

Sung Ho Lee, Taejung Park, Chang Hun Kim

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


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
Issue number2 PART4
Publication statusPublished - 2013 May

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design

Cite this