Demo Data from EDBT 2026 / reviewers in the wild / expert
Gary A. Crocker
dblp:46/7011
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1987
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorHuman-computer interaction and ubiquitous computing · 2 · 2 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
2 papers |
Geometric modeling and processing · 67% Rendering · 33% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing › solid modeling
boundary evaluation |
0.0 | 1 | 1987 | Boundary evaluation of non-convex primitives to produce parametric trimmed surfaces · SIGGRAPH 1987 |
Geometric modeling and processing › shape modeling › parametric modeling
parametric surfaces |
0.0 | 1 | 1987 | Boundary evaluation of non-convex primitives to produce parametric trimmed surfaces · SIGGRAPH 1987 |
Geometric modeling and processing
solid modeling |
0.0 | 1 | 1987 | Boundary evaluation of non-convex primitives to produce parametric trimmed surfaces · SIGGRAPH 1987 |
Geometric modeling and processing › computer-aided design › computer-aided geometric design
trimmed surface |
0.0 | 1 | 1987 | Boundary evaluation of non-convex primitives to produce parametric trimmed surfaces · SIGGRAPH 1987 |
Rendering
hidden surface removal |
0.0 | 1 | 1984 | Invisibility coherence for faster scan-line hidden surface algorithms · SIGGRAPH 1984 |
Rendering › hidden surface removal
scan-line algorithms |
0.0 | 1 | 1984 | Invisibility coherence for faster scan-line hidden surface algorithms · SIGGRAPH 1984 |
Rendering
visibility computation |
0.0 | 1 | 1984 | Invisibility coherence for faster scan-line hidden surface algorithms · SIGGRAPH 1984 |
Methods — techniques the papers use, named apart from their topics
ray firing classification · 0.0halfspace-based classification · 0.0curve refinement · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1987 | Boundary evaluation of non-convex primitives to produce parametric trimmed surfacesabstractTo integrate a CSG-based solid modeler into an existing wireframe/surface modeling system, new boundary evaluation technology has been developed. This scheme uses exact representations for the simple quadric surfaces and both exact and approximate representations of higher-order curved surfaces. It supports parametric primitives (box, wedge, sphere, cylinder, cone, torus), procedural primitives (extrusion, revolution, tube) and a sculptured surface primitive. The output includes curves, parametric trimmed surfaces, and a data structure of adjacency information.An existing boundary evaluator (PADL-2's) has been enhanced to allow a general non-convex faceted primitive with planar and quadric facets. This new hybrid evaluator combines two techniques for curve/primitive classification. PADL-2's existing halfspace-based classification is reserved for the simple convex primitives, and a new ray firing based classification is applied to the non-convex primitives. After evaluation, approximate intersection curves (from intersections involving higher order surfaces) are refined to a specified tolerance by exploiting an exact parametric representation of the surfaces of the primitives. The refined curves and the quadric surface intersection curves are used to create a parametric trimmed surface representation of the solid. This combination of techniques and representations offers advantages in accuracy, robustness and efficiency suitable to a production environment. Gary A. Crocker, William F. Reinke |
SIGGRAPH | 1 |
| 1984 | Invisibility coherence for faster scan-line hidden surface algorithmsabstractInvisibility coherence is a new technique developed to decrease the time necessary to render shaded images by existing scan-line hidden surface algorithms. Invisibility coherence is a technique for removing portions of a scene that are not likely to be visible. If a large portion of the scene is invisible, as is often the case in three-dimensional computer graphics, the processing time eliminated may be substantial. Invisibility coherence takes advantage of the observation that a minimal amount of processing needs to be done on objects (polygons, patches, or surfaces) that will be hidden by other objects closer to the viewer. This fact can be used to increase the efficiency of current scan-line algorithms, including both polygon-based and parametrically curved surface-based algorithms. Gary A. Crocker |
SIGGRAPH | 1 |