Files:DescriptionFile size FormatBrowse
Fulltext2.71 MBPDF (requires Acrobat Reader)Previous | Next
  
Authors:Martina Málková: Department of Computer Science and Engineering, University of West Bohemia, Czech Republic
Ivana Kolingerová: Department of Computer Science and Engineering, University of West Bohemia, Czech Republic
Jindrich Parus: Department of Computer Science and Engineering, University of West Bohemia, Czech Republic
Publication title:Core-based morphing algorithm for triangle meshes
Conference:SIGRAD 2008. The Annual SIGRAD Conference Special Theme: Interaction; November 27–28; 2008 Stockholm; Sweden
Publication type: Abstract and Fulltext
Issue:034
Article No.:011
Abstract:This paper presents a method for the metamorphosis of genus-0 triangle meshes based on their intersection. It is an extension of our previous 2D algorithm [M´alkov´a; 2007]. Our algorithm is designed to simulate growing processes; therefore it is useful for morphing objects; where the user expects some parts of the latter object to grow out from the former one (e.g. a head with and without horns). The user can influence the algorithm’s behavior by changing the mutual position of the objects; while the results are easily predictable.

CR Categories: I.3.5 [Computational Geometry and Object Modeling]: Boundary representations— [I.3.7]: Three-Dimensional Graphics and Realism—Animation

Language:English
Keywords:Morphing; triangle meshes; mesh intersection
Year:2008
No. of pages:8
Pages:39-46
Series:Linköping Electronic Conference Proceedings
ISSN (print):1650-3686
ISSN (online):1650-3740
File:http://www.ep.liu.se/ecp/034/011/ecp083411.pdf
Available:2008-11-27
Publisher:Linköping University Electronic Press; Linköpings universitet

REFERENCE TO THIS PAGE
Martina Málková, Ivana Kolingerová, Jindrich Parus (2008). Core-based morphing algorithm for triangle meshes, SIGRAD 2008. The Annual SIGRAD Conference Special Theme: Interaction; November 27–28; 2008 Stockholm; Sweden http://www.ep.liu.se/ecp_article/index.en.aspx?issue=034;article=011 (accessed 11/1/2014)