Inexact Shapes-where a single model is capable of representing a class of shapes-provide an abstraction that is useful in conceptual design, object recognition, morphing, etc. In this work we present an axis-based model for ambiguous shape modeling. This is done by perturbing the links in an axial model of a contour in arbitrary ways. We demonstrate an optimization application in this paper where we start not from a parametrized or relatively static geometry, but from a exibly deened class of shapes. In typical geometric optimization tasks, often the geometry is so far constrained in deening the problem that many better optima actually may lie outside the search space. This paradigm provides a means for capturing a wider class of feasible shapes. A real-coded Genetic Algorithm has been used in this work to implement the visualization and optimization of the inexact shapes. Results are shown for a wide range of contour shapes from biological objects to discrete parts and buildings.
[1]
Chee-Keng Yap,et al.
AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments
,
1987,
Discret. Comput. Geom..
[2]
Steven Fortune,et al.
A sweepline algorithm for Voronoi diagrams
,
1986,
SCG '86.
[3]
A. Mukerjee,et al.
Qualitative Subdivision Algebra: Moving Towards the Quantitative
,
1995
.
[4]
D. T. Lee,et al.
Medial Axis Transformation of a Planar Shape
,
1982,
IEEE Transactions on Pattern Analysis and Machine Intelligence.
[5]
Amitabha Mukerjee,et al.
A Qualitative Model for Space
,
1990,
AAAI.
[6]
David E. Goldberg,et al.
Genetic Algorithms in Search Optimization and Machine Learning
,
1988
.
[7]
Kalyanmoy Deb,et al.
Simulated Binary Crossover for Continuous Search Space
,
1995,
Complex Syst..