ACM Home Page
Please provide us with feedback. Feedback
A modular geometric constraint solver for user interface applications
Full text PdfPdf (901 KB)
Source Symposium on User Interface Software and Technology archive
Proceedings of the 14th annual ACM symposium on User interface software and technology table of contents
Orlando, Florida
SESSION: Papers: Managing user interaction table of contents
Pages: 91 - 100  
Year of Publication: 2001
ISBN:1-58113-438-X
Author
Hiroshi Hosobe  National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan
Sponsors
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
SIGCHI: ACM Special Interest Group on Computer-Human Interaction
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 45,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/502348.502362
What is a DOI?

ABSTRACT

Constraints have been playing an important role in the user interface field since its infancy. A prime use of constraints in this field is to automatically maintain geometric layouts of graphical objects. To facilitate the construction of constraint-based user interface applications, researchers have proposed various constraint satisfaction methods and constraint solvers. Most previous research has focused on either local propagation or linear constraints, excluding more general nonlinear ones. However, nonlinear geometric constraints are practically useful to various user interfaces, e.g., drawing editors and information visualization systems. In this paper, we propose a novel constraint solver called Chorus, which realizes various powerful nonlinear geometric constraints such as Euclidean geometric, non-overlapping, and graph layout constraints. A key feature of Chorus is its module mechanism that allows users to define new kinds of geometric constraints. Also, Chorus supports "soft" constraints with hierarchical strengths or preferences (i.e., constraint hierarchies). We describe its framework, algorithm, implementation, and experimental results.


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
Carter, E. Simulated Annealing Package. http://www.taygeta.com/annealing/.
 
4
5
 
6
 
7
8
 
9
Goffe, B. SIMANN. Netlib. http://www.netlib.org/opt/simann.f.
 
10
 
11
 
12
Heydon, A., and Nelson, G. The Juno-2 constraintbased drawing editor. Research Report 131a, Digital Systems Research Center, 1994.
 
13
14
 
15
16
 
17
Kitano, H., Ed. Genetic Algorithms. Sangyo-Tosho, 1993. In Japanese.
 
18
 
19
 
20
Masui, T. Graphic object layout with interactive genetic algorithms. In Proc. IEEE VL, 1992, 74-80.
21
22
23
 
24
Saltire Software. Constraint geometry. http://www.saltire.com/constraints.html.
25
 
26
Spellucci, R DONLP2. Netlib. http://www.netlib.org/opt/donlp2/.
 
27
Sutherland, I. E. Sketchpad: A man-machine graphical communication system. In Proc. AFIPS Spring Joint Conf., 1963, 329-346.
 
28

CITED BY  9