Skip to main content
SpringerLink
Log in

A Scalable Linear Constraint Solver for User Interface Construction

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming – CP 2000 (CP 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1894))

Abstract

This paper proposes an algorithm for satisfying systems of linear equality and inequality constraints with hierarchical strengths or preferences. Basically, it is a numerical method that incrementally obtains the LU decompositions of linear constraint systems. To realize this, it introduces a novel technique for analyzing hierarchical systems of linear constraints. In addition, it improves performance by adopting techniques that utilize the sparsity and disjointness of constraint systems. Based on this algorithm, the HiRise constraint solver has been designed and implemented for the use of constructing interactive graphical user interfaces. This paper shows that HiRise is scalable up to thousands of simultaneous constraints in real-time execution.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Badros, G. J., Borning, A.: The Cassowary linear arithmetic constraint solving algorithm: Interface and implementation. Tech. Rep. 98-06-04, Dept. of Computer Science and Engineering, Univ. of Washington, 1998.

    Google Scholar 

  2. Borning, A., Anderson, R., Freeman-Benson, B.: Indigo: A local propagation algorithm for inequality constraints. In Proc. ACM UIST, pp. 129–136, 1996.

    Google Scholar 

  3. Borning, A., Freeman-Benson, B., Wilson, M.: Constraint hierarchies. Lisp and Symbolic Computation, 5(3):223–270, 1992.

    Article  Google Scholar 

  4. Borning, A., Marriott, K., Stuckey, P., Xiao, Y.: Solving linear arithmetic constraints for user interface applications. In Proc. ACM UIST, pp. 87–96, 1997.

    Google Scholar 

  5. Chvátal, V.: Linear Programming. Freeman, 1983.

    Google Scholar 

  6. Freeman-Benson, B. N., Maloney, J., Borning, A.: An incremental constraint solver. Comm. ACM, 33(1):54–63, 1990.

    Article  Google Scholar 

  7. Harvey, W., Stuckey, P., Borning, A.: Compiling constraint solving using projection. In Principles and Practice of Constraint Programming—CP97, vol. 1330 of LNCS, pp. 491–505. Springer, 1997.

    Chapter  Google Scholar 

  8. Hosobe, H.: Theoretical Properties and Efficient Satisfaction of Hierarchical Constraint Systems. PhD thesis, Dept. of Information Science, Univ. of Tokyo, 1998.

    Google Scholar 

  9. Hosobe, H., Miyashita, K., Takahashi, S., Matsuoka, S., Yonezawa, A.: Locally simultaneous constraint satisfaction. In Principles and Practice of Constraint Programming—PPCP’94, vol. 874 of LNCS, pp. 51–62. Springer, 1994.

    Google Scholar 

  10. Marriott, K., Chok, S. C., Finlay, A.: A tableau based constraint solving toolkit for interactive graphical applications. In Principles and Practice of Constraint Programming—CP98, vol. 1520 of LNCS, pp. 340–354. Springer, 1998.

    Google Scholar 

  11. Oguni, C., Murata, K., Miyoshi, T., Dongarra, J. J., Hasegawa, H.: Matrix Computing Software. Maruzen, 1991. In Japanese.

    Google Scholar 

  12. Press, W. H., Flannery, B. P., Teukolsky, S. A., Vetterling, W. T.: NUMERICAL RECIPES in C: The Art of Scientific Computing. Cambridge University Press, 1988.

    Google Scholar 

  13. Refalo, P., Hentenryck, P.V.: CLP(Rlin) revised. In Proc. JICSLP, pp. 22–36. MIT Press, 1996.

    Google Scholar 

  14. Sannella, M.: SkyBlue: A multi-way local propagation constraint solver for user interface construction. In Proc. ACM UIST, pp. 137–146, 1994.

    Google Scholar 

  15. Vander Zanden, B.: An incremental algorithm for satisfying hierarchies of multi-way dataflow constraints. A CM Trans. Prog. Lang. Syst., 18(1):30–72, 1996.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Institute of Informatics, 2-1-2 HitotsubashiChiyoda-ku, Tokyo, 101-8430, Japan

    Hiroshi Hosobe

Authors
  1. Hiroshi Hosobe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California at Irvine, Irvine, CA, 92697, USA

    Rina Dechter

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hosobe, H. (2000). A Scalable Linear Constraint Solver for User Interface Construction. In: Dechter, R. (eds) Principles and Practice of Constraint Programming – CP 2000. CP 2000. Lecture Notes in Computer Science, vol 1894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45349-0_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-45349-0_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41053-9

  • Online ISBN: 978-3-540-45349-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation