Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jean-Claude Hervé

dblp:97/794 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1989
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 1Human-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.

Theoretical computer science
1 paper
Computational geometry · 75% Algorithms and data structures · 25%

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

TopicWeightPapersLastEvidence papers
Computational geometry › geometric intersection › curve intersection
bézier curve intersection
0.011989
Incremental computation of planar maps · SIGGRAPH 1989
Computational geometry › geometric intersection
curve intersection
0.011989
Incremental computation of planar maps · SIGGRAPH 1989
Algorithms and data structures › dynamic algorithms
incremental algorithms
0.011989
Incremental computation of planar maps · SIGGRAPH 1989
Computational geometry › geometric data structures
planar map
0.011989
Incremental computation of planar maps · SIGGRAPH 1989

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

exact forward differencing · 0.0bounded rational arithmetic · 0.0
YearPublicationVenuePosition
1989 Incremental computation of planar maps
abstract
A planar map is a figure formed by a set of intersecting lines and curves. Such an object captures both the geometrical and the topological information implicitly defined by the data. In the context of 2D drawing it provides a new interaction paradigm, map sketching, for editing graphic shapes.To build a planar map, one must compute curve intersections and deduce from them the map they define. The computed topology must be consistent with the underlying geometry. Robustness of geometric computations is a key issue in this process. We present a robust solution to Bézier curve intersection that uses exact forward differencing and bounded rational arithmetic. Then, we describe data structure and algorithms to support incremental insertion of Bézier curves in a planar map. A prototype illustration tool using this method is also discussed.
Michel Gangnet, Jean-Claude Hervé, Thierry Pudet, Jean-Manuel Van Thong
SIGGRAPH2