ACM Home Page
Please provide us with feedback. Feedback
Computing surface offsets and bisectors using a sampled constraint solver
Full text PdfPdf (910 KB)
Source
ACM International Conference Proceeding Series; Vol. 324 archive
Proceedings of Graphics Interface 2009 table of contents
Kelowna, British Columbia, Canada
SESSION: Surfaces and meshes table of contents
Pages 31-37  
Year of Publication: 2009
ISBN ~ ISSN:0713-5424 , 978-1-56881-470-4
Authors
David E. Johnson  University of Utah
Elaine Cohen  University of Utah
Sponsor
: The Canadian Human-Computer Communications Society / Société Canadienne du Dialogue Humaine Machine (CHCCS/SCDHM)
Publisher
Canadian Information Processing Society  Toronto, Ont., Canada, Canada
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 29,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

This paper describes SCSolver, a geometric constraint solver based on adaptive sampling of an underlying constraint space. The solver is demonstrated on the computation of the offset to a surface as well as the computation of the bisector between two surfaces. The adaptive constraint sampling generates a solution manifold through a generalized dual-contouring approach appropriate for higher-dimensional problems. Experimental results show that the SCSolver approach can compute solutions for complex input geometry at interactive rates for each example application.


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
 
2
3
4
 
5
J.-c. L. Fabian Schwarzer, Mitul Saha. Exact collision checking of robot paths, 2002.
 
6
M. Foskey, M. Garber, M. Lin, and D. Manocha. A voronoi-based hybrid motion planner for rigid bodies, 2001.
 
7
 
8
 
9
10
 
11
 
12
E. Larsen, S. Gottschalk, M. Lin, and D. Manocha. Fast distance queries with rectangular swept sphere volumes. In IEEE International Conference on Robotics and Automation (ICRA), pages 24--48, 2000.
13
 
14
K. Museth, D. Breen, R. Whitaker, S. Mauch, and D. Johnson. Algorithms for interactive editing of level set models. Computer Graphics Forum, 24(4):1--22, 2005.
 
15
 
16
 
17
D. Pavic and L. Kobbelt. High-resolution volumetric computation of offset surfaces with feature preservation. Computer Graphics Forum, 27(2): 165--174, April 2008.
18
 
19
J.-K. Seong, G. Elber, and E. Cohen. Simultaneous precise solutions to the visibility problem of sculptured models. In GMP, pages 451--464, 2006.
 
20
J.-K. Seong, G. Elber, and M.-S. Kim. Trimming local and global self-intersections in offset curves/surfaces using distance maps. Computer Aided Design, 38(3):183--193, 2006.
21
 
22
 
23
 
24
A. Sud, M. Otaduy, and D. Manocha. Difi: Fast 3d distance field computation using graphics hardware. Computer Graphics Forum, 23(3):557--566, 2004.
 
25
K. Wentland and D. Dutta. Method for offset-curve generation for sheet-metal design. Computer-Aided Design, 25(10):662--670, 1993.

Collaborative Colleagues:
David E. Johnson: colleagues
Elaine Cohen: colleagues