Understanding the limits of a design is an important aspect of the design process. When mathematical models are constructed to describe a design concept, the limits are typically expressed as constraints involving the variables of that concept. The set of values for the design variables that do not violate constraints constitute the design space of that concept. In this work, we transform a parametric design problem into a geometry problem thereby enabling computational geometry algorithms to support design exploration. A polytope-based representation is presented to geometrically approximate the design space. The design space is represented as a finite set of (at most) three-dimensional (possibly nonconvex) polytopes, i.e., points, intervals, polygons, and polyhedra. The algorithm for constructing the design space is developed by interpreting constraint-consistency algorithms as computational-geometric operations and consequently extending (3,2)-consistency algorithm for polytope representations. A simple example of a fingernail clipper design is used to illustrate the approach.

1.
Otto
,
K.
, and
Wood
,
K.
, 2001,
Product Design: Techniques in Reverse Engineering and New Product Development
,
Prentice Hall
,
Upper Saddle River, NJ
.
2.
Wang
,
G. G.
, and
Shan
,
S.
, 2007, “
Review of Metamodeling Techniques in Support of Engineering Design Optimization
,”
ASME J. Mech. Des.
0161-8458,
129
(
4
), pp.
370
380
.
3.
Stump
,
G. M.
,
Yukish
,
M.
,
Simpson
,
T. W.
, and
O’Hara
,
J. J.
, 2004, “
Trade Space Exploration of Satellite Datasets Using a Design by Shopping Paradigm
,”
Proceedings of IEEE Aerospace Conference
, Vol.
6
, pp.
3885
3895
.
4.
Ward
,
A. C.
, 1989, “
A Theory of Quantitative Inference Applied to a Mechanical Design Compiler
,” Ph.D. thesis, Department of Mechanical Engineering, Massachusetts Institute of Technology, Boston, MA.
5.
Benhamou
,
F.
, 1995, “
Interval Constraint Logic Programming
,”
Proceedings of Constraint Programming, Basics and Trends, LNCS 910
, pp.
1
21
.
6.
Yannou
,
B.
,
Simpson
,
T. W.
, and
Barton
,
R. R.
, 2003, “
Towards a Conceptual Design Explorer Using Meta-Modeling Approaches and Constraint Programming
,”
ASME
Paper No. DETC2003/DAC-48766.
7.
Granvilliers
,
L.
, and
Benhamou
,
F.
, 2006, “
Algorithm 852: Realpaver: An Interval Solver Using Constraint Satisfaction Techniques
,”
ACM Trans. Math. Softw.
0098-3500,
32
(
1
), pp.
138
156
.
8.
Fünfzig
,
F.
,
Michelucci
,
D.
, and
Foufou
,
S.
, 2009, “
Nonlinear Systems Solver in Floating-Point Arithmetic Using LP Reduction
,”
Proceedings of the 2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
, San Fransisco, CA, pp.
123
134
.
9.
Sam-Haroud
,
D.
, and
Faltings
,
B.
, 1996, “
Consistency Techniques for Continuous Constraints
,”
Constraints
1383-7133,
1
(
1–2
), pp.
85
118
.
10.
Lottaz
,
C.
, 2000, “
Collaborative Design Using Solution Spaces
,” Ph.D. thesis, Ecole Polytechnique Fédérale de Lausanne, EFPL, Lausanne, Switzerland.
11.
Jermann
,
C.
,
Neumaier
,
A.
, and
Sam
,
D.
, 2005,
Global Optimization and Constraint Satisfaction
,
Springer-Verlag
,
Berlin
.
12.
Mortenson
,
M. E.
, 2006,
Geometric Modeling
,
Industrial Press
,
New York
.
13.
Vu
,
X. -H.
,
Sam-Haroud
,
D.
, and
Silaghi
,
M. -C.
, 2003,
Numerical Constraint Satisfaction Problems With Non-Isolated Solutions
,
Springer
,
Berlin
.
14.
Goldsztein
,
A.
, and
Granvilliers
,
L.
, 2008, “
A New Framework for Sharp and Effective Resolution of Ncsps With Manifolds of Solutions
,”
Principles and Practice of Constraint Programming, 14th International Conference, CP 2008
, Sydney, Australia, Sep. 14–18.
15.
Goyal
,
V.
, 2005, “
Design and Synthesis of Flexible Module Based Systems
,” Ph.D. thesis, Department of Chemical Engineering, Rutgers, State University of New Jersey, New Brunswick, NJ.
16.
Combastel
,
C.
, 2003, “
A State Bounding Observer Based on Zonotopes
,”
European Control Conference 2003
, Cambridge, UK.
17.
Yan
,
X. -T.
, and
Sawada
,
H.
, 2006, “
A Framework for Supporting Multidisciplinary Engineering Design Exploration and Life-Cycle Design Using Underconstrained Problem Solving
,”
Artif. Intell. Eng. Des. Anal. Manuf.
0890-0604,
20
(
4
), pp.
329
350
.
18.
Dechter
,
R.
, 2003,
Constraint Processing
,
Morgan Kaufmann
,
San Francisco, CA
.
19.
Rossi
,
F.
,
Van Beek
,
P.
, and
Walsh
,
T.
, 2006,
Handbook of Constraint Programming
,
Elsevier
,
Amsterdam, The Netherlands
.
20.
Samet
,
H.
, 2006,
Foundations of Multidimensional and Metric Data Structures
,
Morgan Kaufmann
,
San Mateo, CA
.
21.
Lottaz
,
C.
,
Smith
,
I. F. C.
,
Robert-Nicoud
,
Y.
, and
Faltings
,
B. V.
, 2000, “
Constraint-Based Support for Negotiation in Collaborative Design
,”
Artif. Intell. Eng.
0954-1810,
14
, pp.
261
280
.
22.
Agoston
,
M. A.
, 2005,
Computer Graphics & Geometric Modeling: Mathematics
,
Springer
,
London, UK
.
23.
Fink
,
E.
, and
Wood
,
D.
, 1996, “
Fundamentals of Restricted-Orientation Convexity
,”
Inf. Sci. (N.Y.)
0020-0255,
92
, pp.
175
196
.
24.
2009, www.cgal.orgwww.cgal.org, Computational Geometric Algorithms Library, Accessed February.
25.
Tenne
,
Y.
, 2008, “
Metamodel Accuracy Assesment in Evolutionary Optimization
,”
Proceedings of IEEE World Congress on Computational Intelligence—WCCI 2008
, pp.
1505
1512
.
26.
Baldi
,
P.
,
Brunak
,
S.
,
Chauvin
,
Y.
,
Anderson
,
C. A. F.
, and
Nielson
,
H.
, 2000, “
Assessing the Accuracy of Prediction Algorithms for Classification: An Overview
,”
Bioinformatics
1367-4803,
16
(
5
), pp.
412
424
.
You do not currently have access to this content.