Pascal Mathis

dblp:45/3435 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-authorArtificial intelligence and machine learning · 2Theory of computation · 2 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
3 papers
Geometric modeling and processing · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Geometric modeling and processing
geometric constraint solving
0.422014
Coordinate-free geometry and decomposition in geometrical constraint solving · Comput. Aided Des. 2014
Leading a continuation method by geometry for solving geometric constraints · Comput. Aided Des. 2014
Geometric modeling and processing
continuation method
0.212014
Leading a continuation method by geometry for solving geometric constraints · Comput. Aided Des. 2014
Geometric modeling and processing › computational geometry
geometric construction
0.011998
Geometric Construction by Assembling Solved Subfigures · Artif. Intell. 1998

Methods — techniques the papers use, named apart from their topics

constraint solving · 0.0
YearPublicationVenuePosition
2019 Using jointly geometry and algebra to determine RC-constructibility
Pascal Schreck, Pascal Mathis
J. Symb. Comput.2
2014 Leading a continuation method by geometry for solving geometric constraints
Rémi Imbach, Pascal Schreck, Pascal Mathis
Comput. Aided Des.3
2014 Coordinate-free geometry and decomposition in geometrical constraint solving
Pascal Mathis, Pascal Schreck
Comput. Aided Des.1
2012 Geometric Construction Problem Solving in Computer-Aided Learning
abstract
Constraint satisfaction problems related to geometry mostly arise in CAD. But even though they are designed for geometry, none of the methods proposed to solve these problems fully meets the requirements needed by the educational domain. In this paper, we adapt CAD methods to education and show that results must be construction programs in order to take into account particular cases. We present then a framework implemented in Prolog as a knowledge-based system called Progé.
Pascal Schreck, Pascal Mathis, Julien Narboux
ICTAI2
2010 A formalization of geometric constraint systems and their decomposition
abstract
Abstract For more than a decade, the trend in geometric constraint systems solving has been to use a geometric decomposition/recombination approach. These methods are generally grounded on the invariance of systems under rigid motions. In order to decompose further, other invariance groups (e.g., scalings) have recently been considered. Geometric decomposition is grounded on the possibility to replace a solved subsystem with a smaller system called boundary . This article shows the central property that justifies decomposition, without assuming specific types of constraints or invariance groups. The exact nature of the boundary system is given. This formalization brings out the elements of a general and modular implementation.
Pascal Mathis, Simon E. B. Thierry
Formal Aspects Comput.1
2001 Interactive Handling of a Construction Plan in CAD
Caroline Essert, Pascal Mathis
IV2
1998 Geometric Construction by Assembling Solved Subfigures
Jean-François Dufourd, Pascal Mathis, Pascal Schreck
Artif. Intell.2