Geometric Constraints Solving: Some tracks

Dominique Michelucci; Sebti Foufou; Loic Lamarque; Pascal Schreck

Geometric Constraints Solving: Some tracks

Dominique Michelucci, Sebti Foufou, Loic Lamarque, Pascal Schreck

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

This paper presents some important issues and potential research tracks for Geometric Constraint Solving: the use of the simplicial Bernstein base to reduce the wrapping effect in interval methods, the computation of the dimension of the solution set with methods used to measure the dimension of fractals, the pitfalls of graph based decomposition methods, the alternative provided by linear algebra, the witness configuration method, the use of randomized provers to detect dependences between constraints, the study of incidence constraints, the search for intrinsic (coordinate-free) formulations and the need for formal specifications.

Original language	English (US)
Title of host publication	Proceedings SPM 2006 - ACM Symposium on Solid and Physical Modeling
Pages	185-196
Number of pages	12
State	Published - 2006
Event	SPM 2006 - ACM Symposium on Solid and Physical Modeling - Wales, United Kingdom Duration: Jun 6 2005 → Jun 8 2005

Publication series

Name	Proceedings SPM 2006 - ACM Symposium on Solid and Physical Modeling
Volume	2006

Other

Other	SPM 2006 - ACM Symposium on Solid and Physical Modeling
Country/Territory	United Kingdom
City	Wales
Period	6/6/05 → 6/8/05

Keywords

Bernstein base
Decomposition
Geometric Constraints Solving
Incidence constraint
Projective geometry
Randomized prover
Rigidity theory
Witness configuration

ASJC Scopus subject areas

General Engineering

Cite this

@inproceedings{8e0718eb208046d7b99fcca3968999d4,

title = "Geometric Constraints Solving: Some tracks",

abstract = "This paper presents some important issues and potential research tracks for Geometric Constraint Solving: the use of the simplicial Bernstein base to reduce the wrapping effect in interval methods, the computation of the dimension of the solution set with methods used to measure the dimension of fractals, the pitfalls of graph based decomposition methods, the alternative provided by linear algebra, the witness configuration method, the use of randomized provers to detect dependences between constraints, the study of incidence constraints, the search for intrinsic (coordinate-free) formulations and the need for formal specifications.",

keywords = "Bernstein base, Decomposition, Geometric Constraints Solving, Incidence constraint, Projective geometry, Randomized prover, Rigidity theory, Witness configuration",

author = "Dominique Michelucci and Sebti Foufou and Loic Lamarque and Pascal Schreck",

year = "2006",

language = "English (US)",

isbn = "1595933581",

series = "Proceedings SPM 2006 - ACM Symposium on Solid and Physical Modeling",

pages = "185--196",

booktitle = "Proceedings SPM 2006 - ACM Symposium on Solid and Physical Modeling",

note = "SPM 2006 - ACM Symposium on Solid and Physical Modeling ; Conference date: 06-06-2005 Through 08-06-2005",

}

TY - GEN

T1 - Geometric Constraints Solving

T2 - SPM 2006 - ACM Symposium on Solid and Physical Modeling

AU - Michelucci, Dominique

AU - Foufou, Sebti

AU - Lamarque, Loic

AU - Schreck, Pascal

PY - 2006

Y1 - 2006

N2 - This paper presents some important issues and potential research tracks for Geometric Constraint Solving: the use of the simplicial Bernstein base to reduce the wrapping effect in interval methods, the computation of the dimension of the solution set with methods used to measure the dimension of fractals, the pitfalls of graph based decomposition methods, the alternative provided by linear algebra, the witness configuration method, the use of randomized provers to detect dependences between constraints, the study of incidence constraints, the search for intrinsic (coordinate-free) formulations and the need for formal specifications.

AB - This paper presents some important issues and potential research tracks for Geometric Constraint Solving: the use of the simplicial Bernstein base to reduce the wrapping effect in interval methods, the computation of the dimension of the solution set with methods used to measure the dimension of fractals, the pitfalls of graph based decomposition methods, the alternative provided by linear algebra, the witness configuration method, the use of randomized provers to detect dependences between constraints, the study of incidence constraints, the search for intrinsic (coordinate-free) formulations and the need for formal specifications.

KW - Bernstein base

KW - Decomposition

KW - Geometric Constraints Solving

KW - Incidence constraint

KW - Projective geometry

KW - Randomized prover

KW - Rigidity theory

KW - Witness configuration

UR - http://www.scopus.com/inward/record.url?scp=33745960564&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745960564&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33745960564

SN - 1595933581

SN - 9781595933584

T3 - Proceedings SPM 2006 - ACM Symposium on Solid and Physical Modeling

SP - 185

EP - 196

BT - Proceedings SPM 2006 - ACM Symposium on Solid and Physical Modeling

Y2 - 6 June 2005 through 8 June 2005

ER -

Geometric Constraints Solving: Some tracks

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this