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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Silvio V. F. Levy

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

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

Graphics, computer vision, multimedia, augmented reality and games · 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 · 56% Image and video processing · 44%

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

TopicWeightPapersLastEvidence papers
Image and video processing › edge detection
edge tracing		 0.011990
Contour tracing by piecewise linear approximations · ACM Trans. Graph. 1990
Geometric modeling and processing › computational geometry › geometric approximation
piecewise linear approximation		 0.011990
Contour tracing by piecewise linear approximations · ACM Trans. Graph. 1990
Geometric modeling and processing › computational geometry › polygonal partitioning
triangulation		 0.011990
Contour tracing by piecewise linear approximations · ACM Trans. Graph. 1990

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

reflection-generated triangulations · 0.0piecewise linear approximation · 0.0
YearPublicationVenuePosition
1990 Contour tracing by piecewise linear approximations
abstract
We present a method for tracing a curve that is represented as the contour of a function in Euclidean space of any dimension. The method proceeds locally by following the intersections of the contour with the facets of a triangulation of space. The algorithm does not fail in the presence of high curvature of the contour; it accumulates essentially no round-off error and has a well-defined integer test for detecting a loop. In developing the algorithm, we explore the nature of a particular class of triangulations of Euclidean space, namely, those generated by reflections.
David P. Dobkin, Allan R. Wilks, Silvio V. F. Levy, William P. Thurston
 ACM Trans. Graph.3