A Simplified Graph Model for User Interface Constraints
Summary :
Constraints have been used extensively for the construction of graphical user interfaces. User interface constraints that are declarative are more favorable but require sophisticated constraint planning algorithms. Constraint planning algorithms proposed previously are getting more and more complicated as they were asked to handle more general requirements. We believe that the difficulty is mainly caused by the complicated data structure that is translated directly from the problem. By a transformation, we propose a simplified graph model for the problem and prove that the constraint planning problem can be reduced to finding feedback vertex sets on the simplified graph model. We also consider the general problem of handling non-uniform user interface constraints.
- Publication
- IEICE TRANSACTIONS on Information Vol.E86-D No.11 pp.2426-2432
- Publication Date
- 2003/11/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Man-Machine Systems, Multimedia Processing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Chuan-Chieh JUNG, Tze-Heng MA, Yue-Sun KUO, "A Simplified Graph Model for User Interface Constraints" in IEICE TRANSACTIONS on Information,
vol. E86-D, no. 11, pp. 2426-2432, November 2003, doi: .
Abstract: Constraints have been used extensively for the construction of graphical user interfaces. User interface constraints that are declarative are more favorable but require sophisticated constraint planning algorithms. Constraint planning algorithms proposed previously are getting more and more complicated as they were asked to handle more general requirements. We believe that the difficulty is mainly caused by the complicated data structure that is translated directly from the problem. By a transformation, we propose a simplified graph model for the problem and prove that the constraint planning problem can be reduced to finding feedback vertex sets on the simplified graph model. We also consider the general problem of handling non-uniform user interface constraints.
URL: https://global.ieice.org/en_transactions/information/10.1587/e86-d_11_2426/_p
Copy
@ARTICLE{e86-d_11_2426,
author={Chuan-Chieh JUNG, Tze-Heng MA, Yue-Sun KUO, },
journal={IEICE TRANSACTIONS on Information},
title={A Simplified Graph Model for User Interface Constraints},
year={2003},
volume={E86-D},
number={11},
pages={2426-2432},
abstract={Constraints have been used extensively for the construction of graphical user interfaces. User interface constraints that are declarative are more favorable but require sophisticated constraint planning algorithms. Constraint planning algorithms proposed previously are getting more and more complicated as they were asked to handle more general requirements. We believe that the difficulty is mainly caused by the complicated data structure that is translated directly from the problem. By a transformation, we propose a simplified graph model for the problem and prove that the constraint planning problem can be reduced to finding feedback vertex sets on the simplified graph model. We also consider the general problem of handling non-uniform user interface constraints.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - A Simplified Graph Model for User Interface Constraints
T2 - IEICE TRANSACTIONS on Information
SP - 2426
EP - 2432
AU - Chuan-Chieh JUNG
AU - Tze-Heng MA
AU - Yue-Sun KUO
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E86-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 2003
AB - Constraints have been used extensively for the construction of graphical user interfaces. User interface constraints that are declarative are more favorable but require sophisticated constraint planning algorithms. Constraint planning algorithms proposed previously are getting more and more complicated as they were asked to handle more general requirements. We believe that the difficulty is mainly caused by the complicated data structure that is translated directly from the problem. By a transformation, we propose a simplified graph model for the problem and prove that the constraint planning problem can be reduced to finding feedback vertex sets on the simplified graph model. We also consider the general problem of handling non-uniform user interface constraints.
ER -
English
