Demo Data from EDBT 2026 / reviewers in the wild / expert
Evan C. Sherbrooke
dblp:28/6592
· DBLP profile ↗
6ranked-venue papers
3as first author
0since 2021 · last 2008
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 6 · 3 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
3 papers |
Geometric modeling and processing · 100% | |
| Theoretical computer science
3 papers |
Mathematical optimization · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing › computational geometry › geometric queries › geometric intersection
curve intersection |
0.0 | 1 | 1996 | Robust interval algorithm for curve intersections · Comput. Aided Des. 1996 |
Geometric modeling and processing › skeletonization
medial axis transform |
0.0 | 1 | 1996 | An Algorithm for the Medial Axis Transform of 3D Polyhedral Solids · IEEE Trans. Vis. Comput. Graph. 1996 |
Mathematical optimization › numerical computation
floating-point arithmetic |
0.0 | 1 | 1998 | Efficient and reliable methods for rounded-interval arithmetic · Comput. Aided Des. 1998 |
Mathematical optimization › numerical analysis
interval arithmetic |
0.0 | 1 | 1996 | Robust interval algorithm for curve intersections · Comput. Aided Des. 1996 |
Methods — techniques the papers use, named apart from their topics
stability analysis · 0.0connectivity theorem · 0.0complexity analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2008 | Solving nonlinear polynomial systems in the barycentric Bernstein basis
Martin Reuter 0001, Tarjei S. Mikkelsen, Evan C. Sherbrooke, Takashi Maekawa, Nicholas M. Patrikalakis |
Vis. Comput. | 3 |
| 1998 | Efficient and reliable methods for rounded-interval arithmeticabstractWe present an efficient and reliable method for computing the unit-in-the-last-place (ulp) of a double-precision floating-point number, taking advantage of the standard binary representation for floatingpoint numbers defined by IEEE Std 754-1985. The ulp is necessary to perform software rounding for robust rounded-interval arithmetic (RIA) operations. Hardware rounding, using two of the standard rounding modes defined by IEEE-754, may be more efficient. RIA has been used to produce robust software systems for the solution of systems of nonlinear equations, interrogation of geometric and differential properties of curves and surfaces, curve and surface intersections, and solid modeling. Stephen L. Abrams, Wonjoon Cho, Chun-Yi Hu, Takashi Maekawa, Nicholas M. Patrikalakis, Evan C. Sherbrooke, Xiuzi Ye |
Comput. Aided Des. | 6 |
| 1996 | Robust interval algorithm for curve intersections
Chun-Yi Hu, Takashi Maekawa, Evan C. Sherbrooke, Nicholas M. Patrikalakis |
Comput. Aided Des. | 3 |
| 1996 | Differential and Topological Properties of Medial Axis Transforms
Evan C. Sherbrooke, Nicholas M. Patrikalakis, Franz-Erich Wolter |
CVGIP Graph. Model. Image Process. | 1 |
| 1996 | An Algorithm for the Medial Axis Transform of 3D Polyhedral SolidsabstractThe medial axis transform (MAT) is a representation of an object which has been shown to be useful in design, interrogation, animation, finite element mesh generation, performance analysis, manufacturing simulation, path planning and tolerance specification. In this paper, an algorithm for determining the MAT is developed for general 3D polyhedral solids of arbitrary genus without cavities, with nonconvex vertices and edges. The algorithm is based on a classification scheme which relates different pieces of the medial axis (MA) to one another, even in the presence of degenerate MA points. Vertices of the MA are connected to one another by tracing along adjacent edges, and finally the faces of the axis are found by traversing closed loops of vertices and edges. Representation of the MA and its associated radius function is addressed, and pseudocode for the algorithm is given along with recommended optimizations. A connectivity theorem is proven to show the completeness of the algorithm. Complexity estimates and stability analysis for the algorithms are presented. Finally, examples illustrate the computational properties of the algorithm for convex and nonconvex 3D polyhedral solids with polyhedral holes. Evan C. Sherbrooke, Nicholas M. Patrikalakis, Erik Brisson |
IEEE Trans. Vis. Comput. Graph. | 1 |
| 1993 | Computation of the solutions of nonlinear polynomial systems
Evan C. Sherbrooke, Nicholas M. Patrikalakis |
Comput. Aided Geom. Des. | 1 |