Adaptive synthesis of distance fields

Sung Ho Lee, Taejung Park, Jong Hyun Kim, Chang Hun Kim

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


We address the computational resource requirements of 3D example-based synthesis with an adaptive synthesis technique that uses a tree-based synthesis map. A signed-distance field (SDF) is determined for the 3D exemplars, and then new models can be synthesized as SDFs by neighborhood matching. Unlike voxel synthesis approach, our input is posed in the real domain to preserve maximum detail. In comparison to straightforward extensions to the existing volume texture synthesis approach, we made several improvements in terms of memory requirements, computation times, and synthesis quality. The inherent parallelism in this method makes it suitable for a multicore CPU. Results show that computation times and memory requirements are very much reduced, and large synthesized scenes exhibit fine details which mimic the exemplars.

Original languageEnglish
Article number5975144
Pages (from-to)1135-1145
Number of pages11
JournalIEEE Transactions on Visualization and Computer Graphics
Issue number7
Publication statusPublished - 2012


  • 3D shape synthesis
  • example-based synthesis

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Computer Graphics and Computer-Aided Design


Dive into the research topics of 'Adaptive synthesis of distance fields'. Together they form a unique fingerprint.

Cite this