Adaptive space decomposition for fast visualization of soft objects

Kyung Ha Min, In Kwon Lee, Chan Mo Park

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We present a fast visualization scheme of soft objects by introducing an efficient evaluation method for a field function. The evaluation of a field function includes distance computation between a point in space and the defining primitives of the soft object. If the unnecessary distance computations between a point in space and the components that do not influence the point can be avoided, the evaluation can be accelerated. For this purpose, we decompose the space into adaptive-sized cells according to the bounding volume of the components and build a data structure called an interval tree through which the influencing components for a point are sought. The bounding volume of a component is generated by considering the radius of a component and k-DOPs. The proposed scheme can be used in many applications for soft objects such as modeling and rendering, especially in the interactive modeling process.

Original languageEnglish
Pages (from-to)1-19
Number of pages19
JournalJournal of Visualization and Computer Animation
Volume14
Issue number1
DOIs
Publication statusPublished - 2003 Feb 1

Fingerprint

Visualization
Decomposition
Data structures

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Graphics and Computer-Aided Design

Cite this

@article{2944feeb9ba645d8810efaad938dbe3a,
title = "Adaptive space decomposition for fast visualization of soft objects",
abstract = "We present a fast visualization scheme of soft objects by introducing an efficient evaluation method for a field function. The evaluation of a field function includes distance computation between a point in space and the defining primitives of the soft object. If the unnecessary distance computations between a point in space and the components that do not influence the point can be avoided, the evaluation can be accelerated. For this purpose, we decompose the space into adaptive-sized cells according to the bounding volume of the components and build a data structure called an interval tree through which the influencing components for a point are sought. The bounding volume of a component is generated by considering the radius of a component and k-DOPs. The proposed scheme can be used in many applications for soft objects such as modeling and rendering, especially in the interactive modeling process.",
author = "Min, {Kyung Ha} and Lee, {In Kwon} and Park, {Chan Mo}",
year = "2003",
month = "2",
day = "1",
doi = "10.1002/vis.300",
language = "English",
volume = "14",
pages = "1--19",
journal = "Computer Animation and Virtual Worlds",
issn = "1546-4261",
publisher = "John Wiley and Sons Ltd",
number = "1",

}

Adaptive space decomposition for fast visualization of soft objects. / Min, Kyung Ha; Lee, In Kwon; Park, Chan Mo.

In: Journal of Visualization and Computer Animation, Vol. 14, No. 1, 01.02.2003, p. 1-19.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Adaptive space decomposition for fast visualization of soft objects

AU - Min, Kyung Ha

AU - Lee, In Kwon

AU - Park, Chan Mo

PY - 2003/2/1

Y1 - 2003/2/1

N2 - We present a fast visualization scheme of soft objects by introducing an efficient evaluation method for a field function. The evaluation of a field function includes distance computation between a point in space and the defining primitives of the soft object. If the unnecessary distance computations between a point in space and the components that do not influence the point can be avoided, the evaluation can be accelerated. For this purpose, we decompose the space into adaptive-sized cells according to the bounding volume of the components and build a data structure called an interval tree through which the influencing components for a point are sought. The bounding volume of a component is generated by considering the radius of a component and k-DOPs. The proposed scheme can be used in many applications for soft objects such as modeling and rendering, especially in the interactive modeling process.

AB - We present a fast visualization scheme of soft objects by introducing an efficient evaluation method for a field function. The evaluation of a field function includes distance computation between a point in space and the defining primitives of the soft object. If the unnecessary distance computations between a point in space and the components that do not influence the point can be avoided, the evaluation can be accelerated. For this purpose, we decompose the space into adaptive-sized cells according to the bounding volume of the components and build a data structure called an interval tree through which the influencing components for a point are sought. The bounding volume of a component is generated by considering the radius of a component and k-DOPs. The proposed scheme can be used in many applications for soft objects such as modeling and rendering, especially in the interactive modeling process.

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

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

U2 - 10.1002/vis.300

DO - 10.1002/vis.300

M3 - Article

AN - SCOPUS:9444235781

VL - 14

SP - 1

EP - 19

JO - Computer Animation and Virtual Worlds

JF - Computer Animation and Virtual Worlds

SN - 1546-4261

IS - 1

ER -