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

Eelco de Lange

dblp:74/1718 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1998
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 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
1 paper
Geometric modeling and processing · 100%
Theoretical computer science
1 paper
Computational geometry · 100%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › computational geometry
minkowski sum
0.011998
Slicing Minkowski sums for satellite antenna layout · Comput. Aided Des. 1998

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

minkowski sum · 0.0
YearPublicationVenuePosition
1998 Slicing Minkowski sums for satellite antenna layout
Jean-Daniel Boissonnat, Eelco de Lange, Monique Teillaud
Comput. Aided Des.2
1997 Minkowski Operations for Satellite Antenna Layout
abstract
Satellite layout is a very hard tw.k because avail- able space for the equipments is small and the physical constraints on the layout are strong.In this article, we show how some physical layout constraints can be modeled geometrically and how Minkowsk] operations can be used to place equipments, and in particular antennas.Since antennas are supposed to be placed onto a satellite wall, search space is two-dimensional.We discuss an algorithm that efficiently calculates only the (planar) part we need of the admissible space and deecribe how we implemented this.
Jean-Daniel Boissonnat, Eelco de Lange, Monique Teillaud
SCG2