Les A. Piegl

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

dblp:84/419 · DBLP profile ↗

← Back

34ranked-venue papers

27as first author

0since 2021 · last 2020

0000-0003-0629-8496ORCID · verified

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

Graphics, computer vision, multimedia, augmented reality and games · 34 · 27 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 12 papers		Geometric modeling and processing · 100%
Theoretical computer science 2 papers		Algorithms and data structures · 80% Computational geometry · 20%

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

Topic	Weight	Papers	Last	Evidence papers
Geometric modeling and processing computer-aided design	0.1	1	2005	Ten challenges in computer-aided design · Comput. Aided Des. 2005
Geometric modeling and processing › surface fitting b-spline surface fitting	0.0	1	2003	Circle approximation using integral B-splines · Comput. Aided Des. 2003
Geometric modeling and processing › shape representation › shape approximation circle approximation	0.0	1	2003	Circle approximation using integral B-splines · Comput. Aided Des. 2003
Geometric modeling and processing › curve fitting biarc approximation	0.0	1	2002	Biarc approximation of NURBS curves · Comput. Aided Des. 2002
Geometric modeling and processing › shape modeling › parametric modeling › spline curves NURBS curve approximation	0.0	1	2002	Biarc approximation of NURBS curves · Comput. Aided Des. 2002
Algorithms and data structures › similarity search › nearest neighbor search k-nearest neighbors	0.0	1	2002	Algorithm for finding all k nearest neighbors · Comput. Aided Des. 2002
Algorithms and data structures › similarity search nearest neighbor search	0.0	1	2002	Algorithm for finding all k nearest neighbors · Comput. Aided Des. 2002
Geometric modeling and processing parameterization	0.0	1	2001	Parametrization for surface fitting in reverse engineering · Comput. Aided Des. 2001
Geometric modeling and processing surface fitting	0.0	1	2001	Parametrization for surface fitting in reverse engineering · Comput. Aided Des. 2001
Geometric modeling and processing › shape modeling › parametric modeling › spline curves b-spline curve representation	0.0	2	1995	Algorithm for degree reduction of B-spline curves · Comput. Aided Des. 1995 Software-engineering approach to degree elevation of B-spline curves · Comput. Aided Des. 1994
Geometric modeling and processing › computer-aided design › computer-aided geometric design › offsetting offset computation	0.0	1	1999	Computing offsets of NURBS curves and surfaces · Comput. Aided Des. 1999
Geometric modeling and processing › shape modeling › parametric modeling › spline surfaces NURBS	0.0	1	1997	Symbolic operators for NURBS · Comput. Aided Des. 1997
Geometric modeling and processing › surface fitting surface skinning	0.0	1	1996	Algorithm for approximate skinning · Comput. Aided Des. 1996
Geometric modeling and processing › computer-aided design › computer-aided geometric design degree reduction	0.0	1	1995	Algorithm for degree reduction of B-spline curves · Comput. Aided Des. 1995
Geometric modeling and processing › mesh generation surface meshing	0.0	1	1995	Tessellating trimmed surfaces · Comput. Aided Des. 1995
Geometric modeling and processing › shape modeling › parametric modeling › spline curves degree elevation	0.0	1	1994	Software-engineering approach to degree elevation of B-spline curves · Comput. Aided Des. 1994
Geometric modeling and processing reverse engineering	0.0	1	2001	Parametrization for surface fitting in reverse engineering · Comput. Aided Des. 2001
Computational geometry convex hull	0.0	1	1992	Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix · Comput. Aided Des. 1992
Computational geometry › triangulation delaunay triangulation	0.0	1	1992	Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix · Comput. Aided Des. 1992

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

integral b-splines · 0.0biarc approximation · 0.0offset computation · 0.0geometry-based triangulation · 0.0symbolic operators · 0.0approximate skinning · 0.0degree reduction algorithm · 0.0software-engineering approach · 0.0sparse matrix computation · 0.0

Year	Publication	Venue	Position
2020	Leveraging Peer Feedback to Improve Visualization Education abstract Peer review is a widely utilized pedagogical feedback mechanism for engaging students, which has been shown to improve educational outcomes. However, we find limited discussion and empirical measurement of peer review in visualization coursework. In addition to engagement, peer review provides direct and diverse feedback and reinforces recently-learned course concepts through critical evaluation of others’ work. In this paper, we discuss the construction and application of peer review in a computer science visualization course, including: projects that reuse code and visualizations in a feedback-guided, continual improvement process and a peer review rubric to reinforce key course concepts. To measure the effectiveness of the approach, we evaluate student projects, peer review text, and a post-course questionnaire from 3 semesters of mixed undergraduate and graduate courses. The results indicate that course concepts are reinforced with peer review—82% reported learning more because of peer review, and 75% of students recommended continuing it. Finally, we provide a road-map for adapting peer review to other visualization courses to produce more highly engaged students. Zachariah Beasley, Alon Friedman, Les A. Piegl, Paul Rosen 0001	PacificVis	3
2005	Ten challenges in computer-aided design Les A. Piegl	Comput. Aided Des.	1
2005	CAD'04 Special Issue: modeling and geometry representations for CAD Les A. Piegl	Comput. Aided Des.	1
2005	CAD'04 Special Issue: Product design, integration and manufacturing Les A. Piegl	Comput. Aided Des.	1
2005	An alternative method of curve interpolation Les A. Piegl, Weiyin Ma, Wayne Tiller	Vis. Comput.	1
2004	Special issue on automated synthesis of human-competitive designs by means of genetic programming Les A. Piegl	Comput. Aided Des.	1
2003	Circle approximation using integral B-splines Les A. Piegl, Wayne Tiller	Comput. Aided Des.	1
2002	Algorithm for finding all k nearest neighbors Les A. Piegl, Wayne Tiller	Comput. Aided Des.	1
2002	Biarc approximation of NURBS curves Les A. Piegl, Wayne Tiller	Comput. Aided Des.	1
2002	Surface skinning revisited Les A. Piegl, Wayne Tiller	Vis. Comput.	1
2001	Parametrization for surface fitting in reverse engineering Les A. Piegl, Wayne Tiller	Comput. Aided Des.	1
2000	Surface approximation to scanned data Les A. Piegl, Wayne Tiller	Vis. Comput.	1
1999	Computing offsets of NURBS curves and surfaces Les A. Piegl, Wayne Tiller	Comput. Aided Des.	1
1999	Filling n-sided regions with NURBS patches Les A. Piegl, Wayne Tiller	Vis. Comput.	1
1998	Geometry-based triangulation of trimmed NURBS surfaces Les A. Piegl, Wayne Tiller	Comput. Aided Des.	1
1998	Computing the derivative of NURBS with respect to a knot Les A. Piegl, Wayne Tiller	Comput. Aided Geom. Des.	1
1997	Symbolic operators for NURBS Les A. Piegl, Wayne Tiller	Comput. Aided Des.	1
1997	Perception of images using cylindrical mapping Jennifer A. Polack, Les A. Piegl, Marc L. Carter	Vis. Comput.	2
1996	Algorithm for approximate skinning Les A. Piegl, Wayne Tiller	Comput. Aided Des.	1
1996	Procedural method for terrain surface interpolation Alok K. Chaturvedi, Les A. Piegl	Comput. Graph.	2
1995	Tessellating trimmed surfaces Les A. Piegl, Arnaud M. Richard	Comput. Aided Des.	1
1995	Algorithm for degree reduction of B-spline curves Les A. Piegl, Wayne Tiller	Comput. Aided Des.	1
1994	Editorial Les A. Piegl	Comput. Aided Des.	1
1994	Software-engineering approach to degree elevation of B-spline curves Les A. Piegl, Wayne Tiller	Comput. Aided Des.	1
1994	Algorithm for constained delaunay triangulation Tsung-Pao Fang, Les A. Piegl	Vis. Comput.	2
1993	Algorithm and data structure for triangulating multiply connected polygonal domains Les A. Piegl, Arnaud M. Richard	Comput. Graph.	1
1992	Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix Tsung-Pao Fang, Les A. Piegl	Comput. Aided Des.	2
1992	An introduction to the curves and surfaces of computer-aided design: Robert C Beach Van Nostrand Reinhold, USA Les A. Piegl	Comput. Aided Des.	1
1992	Integer de Casteljau Algorithm for Rasterizing NURBS Curves abstract Abstract An integer version of the well‐known de Casteljau algorithm of NURBS curves is presented here. The algorithm is used to render NURBS curves of any degree on a raster device by turning on pixels that are closest to the curve. The approximation is independent of the parametrization, that is, it is independent of the weights used. The algorithm works entirely in the screen coordinate system and produces smooth rendering of curves without oversampling. Because of the integer arithmetic used, the algorithm is easily cast in hardware. Narayanan Anantakrishnan, Les A. Piegl	Comput. Graph. Forum	2
1992	Integer subdivision algorithm for rendering NURBS curves Narayanan Anantakrishnan, Les A. Piegl	Vis. Comput.	2
1990	Happy birthday Pierre Bézier Les A. Piegl	Comput. Aided Des.	1
1990	A program development for a university course in geometric modeling Les A. Piegl	Comput. Graph.	1
1988	Coons-type patches Les A. Piegl	Comput. Graph.	1
1983	A fast algorithm for parametric curve plotting Les A. Piegl	Comput. Graph.	1