Constructive tree recovery using genetic algorithms

Abstract : An algorithm is described for recovering a constructive tree representation of a solid from a segmented point-set. The term point-set refers here to a finite set of points on or near the surface of the solid. Constructive geometry refers to the construction of complex solids by recursively applying set operations to simple primitives. It can be implemented on a computer by using a tree data structure with geomet ric primitives (planes, spheres and others) in the leaves and set-operations in the internal nodes. This tree data struc ture is called a constructive tree. A constructive tree can be syntactically translated into representations of solids by real-valued functions with the theory of R-functions. The recovered constructive tree is a correct representation of the point-set if the solid defined by the corresponding function matches the solid defined by the point-set. The search for a constructive tree is performed by a genetic algorithm. The formulation of the problem, the genetic algorithm and its parameters are discussed here.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00461021
Contributor : Morgan Barbier <>
Submitted on : Wednesday, March 3, 2010 - 10:51:00 AM
Last modification on : Thursday, January 17, 2019 - 3:06:04 PM

Identifiers

  • HAL Id : hal-00461021, version 1

Collections

Citation

Pierre-Alain Fayolle, A. Pasko, N. Mirenkov, Christophe Rosenberger, Christian Toinard. Constructive tree recovery using genetic algorithms. VIIP 2006, Aug 2006, Palma De Mallorca, Spain. ⟨hal-00461021⟩

Share

Metrics

Record views

95