|
ABSTRACT
We present a new approach to building a solver for a set of geometric constraints represented by multivariate rational functions. The constraints are formulated using inequalities as well as equalities. When the solution set has dimension larger than zero, we approximate it by fitting a hypersurface to discrete solution points. We also consider a variety of constraint solving problems common in geometric modeling. These include computing ray-traps, bisectors, sweep envelopes, and regions accessible during 5-axis machining.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
K. Abdel-Malek and H.-J. Yeh. Geometric representation of the swept volume using Jacobian rank-deficiency conditions. Computer-Aided Design, Vol 29, pp 457--468, 1997.
|
| |
2
|
|
| |
3
|
G. Elber and E. Cohen. A unified approach to verification in 5- axis freeform milling environments. Computer-Aided Design, Vol 31, No 13, pp 795-804, November 1999.
|
 |
4
|
|
| |
5
|
|
| |
6
|
G. Elber and M.-S. Kim. A computational model for nonrational bisector surfaces: curve-surface and surface-surface bisectors. Proc. of Geometric Modeling and Processing 2000, Hong Kong, pp 364-372, April 10-12, 2000.
|
| |
7
|
|
| |
8
|
|
| |
9
|
G. H. Golub and C. E Van Loan. Matrix Computation. The Johns Hopkins University Press, Baltimore and London, Third Edition, 1996.
|
| |
10
|
H.-S. Heo, M.-S. Kim, and G. Elber. The intersection of two ruled surfaces. Computer-Aided Design, Vol 31, No 1, pp 33- 50, January 1999.
|
| |
11
|
|
| |
12
|
IRIT 8.0 User's Manual, September 2000, Technion. www.cs.technion,ac.il/irit.
|
| |
13
|
|
| |
14
|
J. Lane and R. Riesenfeld. Bounds on a polynomial. BIT, Vol 21, pp 112-117, 1981.
|
 |
15
|
|
| |
16
|
D. G. Luenberger. Linear and Nonlinear Programming. Second Edition, Addison-Wesley, Menlo Park, California, 1984.
|
| |
17
|
|
 |
18
|
|
| |
19
|
S. Tabachnikov. Billiards. Paris: Societe Mathematique de France, 1995.
|
| |
20
|
|
| |
21
|
T. W. Sederberg and A. K. Zundel. Pyramids that bound purface patches. Graphical Models and Image Processing, Vol 58, No 1, pp 75-81, 1996.
|
| |
22
|
|
| |
23
|
D. Wells. The Penguin Dictionary of Curious and Interesting Geometry Penguin Books, New York, 1991.
|
CITED BY 27
|
|
|
|
|
|
|
|
Iddo Hanniel , Ramanathan Muthuganapathy , Gershon Elber , Myung-Soo Kim, Precise Voronoi cell extraction of free-form rational planar closed curves, Proceedings of the 2005 ACM symposium on Solid and physical modeling, p.51-59, June 13-15, 2005, Cambridge, Massachusetts
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Adarsh Krishnamurthy , Rahul Khardekar , Sara McMains , Kirk Haller , Gershon Elber, Performing efficient NURBS modeling operations on the GPU, Proceedings of the 2008 ACM symposium on Solid and physical modeling, June 02-04, 2008, Stony Brook, New York
|
|
|
|
|
|
|
|
|
|
|
|
Xiao-Diao Chen , Jun-Hai Yong , Guozhao Wang , Jean-Claude Paul , Gang Xu, Computing the minimum distance between a point and a NURBS curve, Computer-Aided Design, v.40 n.10-11, p.1051-1054, October, 2008
|
|
|
|
|
|
|
|
|
|
|
|
Xiao-Diao Chen , Linqiang Chen , Yigang Wang , Gang Xu , Jun-Hai Yong , Jean-Claude Paul, Computing the minimum distance between two Bézier curves, Journal of Computational and Applied Mathematics, v.229 n.1, p.294-301, July, 2009
|
|
|
|
|
|
|
|