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

Vasilis Capoyleas

dblp:31/147 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 1997
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-author

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%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › computer-aided design
constraint-based modeling
0.011996
Generic naming in generative, constraint-based design · Comput. Aided Des. 1996
Geometric modeling and processing › computer-aided design
generative design
0.011996
Generic naming in generative, constraint-based design · Comput. Aided Des. 1996
YearPublicationVenuePosition
1997 Weak epsilon-Nets for Points on a Hypersphere
Phillip G. Bradford, Vasilis Capoyleas
Discret. Comput. Geom.2
1996 Generic naming in generative, constraint-based design
abstract
In generative, constraint-based design, users graphically select shape elements of design instances in order to specify shape operations that have generic intent. We discuss techniques for naming algorithmically and generically the identified geometric instance, and report on our experience with implementing these techniques. In a companion paper, we give algorithms for matching the names when editing designs.
Vasilis Capoyleas, Xiangping Chen, Christoph M. Hoffmann
Comput. Aided Des.1
1996 On the Area of the Intersection of Disks in the Plane
abstract
Let C1,…, Cn and C′1,…, C′n be two collections of equal disks in the plane, with centers c1,…, cn and c′1,…, c′n. According to a well-known conjecture of Klee and Wagon (1991), if |ci − cj| ≥ |c′i − c′j| for all i, j, then Area(∩i Ci) ≤ Area(∩i C′i). We prove this statement in the special case when there is a continuous contraction of {c1,…, cn} onto {c′1,…, c′n}.
Vasilis Capoyleas
Comput. Geom.1
1993 Clamping of polygonal objects
abstract
A clamper is composed of two opposing parallel edges with variable distance between them. We present a model that describes when the edges of the clamper and some edges of a polygon produce a clamp on the polygon. Using this model, we show that a fairly large class of polygons can be clamped.
Vasilis Capoyleas
Pattern Recognit. Lett.1