SIGN IN
SIGN UP
Dynamic approximation of complex graphical constraints by linear constraints
Full Text:
PDF
Buy this Article
Authors:
Nathan Hurst
Monash University, Clayton, Victoria 3168, Australia
Kim Marriott
Monash University, Clayton, Victoria 3168, Australia
Peter Moulder
Monash University, Clayton, Victoria 3168, Australia
Published in:
· Proceeding
UIST '02
Proceedings of the 15th annual ACM symposium on User interface software and technology
Pages 191-200
ACM
New York, NY
, USA
©2002
table of contents
ISBN:1-58113-488-6
doi>
10.1145/571985.572012
2002 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 23
· Downloads (cumulative): 337
· Citation Count: 7
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
UIST'13
Share:
|
Tags:
algorithms
conditioning
constraint-solving
constraints
containment
direct manipulation
experimentation
linear approximation
linearization of constraints
non-overlap
sparse, structured, and very large systems
trust regions
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder