REPRESENTING GEOMETRIC OBJECTS USING CONSTRAINT DESCRIPTION GRAPHS

被引:0
|
作者
ZALIK, B
GUID, N
VESEL, A
机构
来源
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The paper demonstrates how geometrical constraints can be applied to add a new level of abstraction to description of geometrical objects. Special attention is given to the interactive insertion of constraints. To support incremental design each inserted constraint has to be solved as soon as possible. Because of this requirement a local propagation of known states is used for constraint solving. It is supported by a biconnected constraint description graph structure. The benefits of this structure are insensibility to the order of inserted constraints and ability of replacing constraints with their inverse couples. To override the ambiguities at constraint solving the approximal values of geometrical elements which are inserted through a sketch are used. From the biconnected constraint description graph an acyclic constraint description graph is generated easily. It is suitable for the generation of instances of generic objects.
引用
收藏
页码:505 / 514
页数:10
相关论文
共 50 条
  • [11] Geometric Constraint Model and Mobility Graphs for Building Utilization Intelligence
    Burgess, Thomas
    Metzler, Barbara
    Ettlinger, Andreas
    Neuner, Hans-Berndt
    2018 NINTH INTERNATIONAL CONFERENCE ON INDOOR POSITIONING AND INDOOR NAVIGATION (IPIN 2018), 2018,
  • [12] Conflict-Free Coloring of Intersection Graphs of Geometric Objects
    Keller, Chaya
    Smorodinsky, Shakhar
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 2397 - 2411
  • [13] Conflict-Free Coloring of Intersection Graphs of Geometric Objects
    Chaya Keller
    Shakhar Smorodinsky
    Discrete & Computational Geometry, 2020, 64 : 916 - 941
  • [14] Conflict-Free Coloring of Intersection Graphs of Geometric Objects
    Keller, Chaya
    Smorodinsky, Shakhar
    DISCRETE & COMPUTATIONAL GEOMETRY, 2020, 64 (03) : 916 - 941
  • [15] Geometric constraint satisfaction using GAAA
    Cao, C. H.
    Li, W. H.
    Yi, R. Q.
    COMPUTATIONAL METHODS, PTS 1 AND 2, 2006, : 977 - 981
  • [16] REPRESENTING CLINICAL NARRATIVES USING CONCEPTUAL GRAPHS
    BAUD, RH
    RASSINOUX, AM
    WAGNER, JC
    LOVIS, C
    JUGE, C
    ALPAY, LL
    MICHEL, PA
    DEGOULET, P
    SCHERRER, JR
    METHODS OF INFORMATION IN MEDICINE, 1995, 34 (1-2) : 176 - 186
  • [17] A MODEL FOR REPRESENTING PROGRAMS USING HIERARCHICAL GRAPHS
    YAU, SS
    GRABOW, PC
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1981, 7 (06) : 556 - 574
  • [18] Sufficient and necessary condition for split graphs completion in geometric constraint solving
    Chengdu Univ. of Info. Technol., Chengdu 610225, China
    不详
    不详
    不详
    Sichuan Daxue Xuebao (Gongcheng Kexue Ban), 2006, 1 (103-108):
  • [19] Geometric separability using orthogonal objects
    Abidha, V. P.
    Ashok, Pradeesha
    INFORMATION PROCESSING LETTERS, 2022, 176
  • [20] Coloring Kk-free intersection graphs of geometric objects in the plane
    Fox, Jacob
    Pach, Janos
    EUROPEAN JOURNAL OF COMBINATORICS, 2012, 33 (05) : 853 - 866