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

David C. Gossard

dblp:88/3062 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
0since 2021 · last 1998
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 6Human-computer interaction and ubiquitous computing · 2Artificial intelligence and machine learning · 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
4 papers
Geometric modeling and processing · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%
Artificial intelligence
1 paper
Robot navigation and mapping · 77% Reinforcement learning · 23%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing
curve fitting
0.011995
Multidimensional curve fitting to unorganized data points by nonlinear minimization · Comput. Aided Des. 1995
Geometric modeling and processing › solid modeling
solid reconstruction
0.011983
Solid model input through orthographic views · SIGGRAPH 1983
Geometric modeling and processing › computer-aided design › computer-aided geometric design › geometric constraints
variational geometry
0.011981
Variational geometry in computer-aided design · SIGGRAPH 1981
Geometric modeling and processing › computer-aided design
constraint-based modeling
0.011981
Variational geometry in computer-aided design · SIGGRAPH 1981

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

assembly modeling · 0.0nonlinear minimization · 0.0connectionist network · 0.0winged edge structure · 0.0wesley-markowski procedure · 0.0matrix method · 0.0constraint equation solving · 0.0
YearPublicationVenuePosition
1998 Automatic triangular mesh generation of trimmed parametric surfaces for finite element analysis
Kenji Shimada, David C. Gossard
Comput. Aided Geom. Des.2
1997 Modeling the assembly of compliant, non-ideal parts
Minho Chang, David C. Gossard
Comput. Aided Des.2
1995 Multidimensional curve fitting to unorganized data points by nonlinear minimization
Lian Fang, David C. Gossard
Comput. Aided Des.2
1988 Connectionist Networks for Learning Coordinated Motion in Autonomous Systems
Jahir Pabon, David C. Gossard
AAAI2
1983 Solid model input through orthographic views
abstract
This paper describes the results of basic studies on procedures for creating solid models of component geometry from two-dimensional orthographic projections. An interactive graphic program was developed to allow the input of three orthographic views of a component geometry by digitizing from a drawing. The views may contain straight lines and circular arcs, solid or dashed. No restrictions are placed on the order or direction of lines and arcs in any view. Using an extension of the Wesley-Markowski procedure, the program constructs a three-dimensional solid model of the object. When the projections are ambiguous, multiple solid models are produced. The solid model may contain planar, cylindrical, conical, spherical and toroidal surfaces. Topological information of the solid model is stored in a winged edge structure. Geometric information is stored as vertex coordinates and surface equations.
Hiroshi Sakurai, David C. Gossard
SIGGRAPH2
1981 Variational geometry in computer-aided design
abstract
A system has been developed which utilizes variational geometry in the design and modification of mechanical parts. Three-dimensional constraints between characteristic points are used to define an object's geometry. Modification of geometry is accomplished by alteration of one or more constraints. A matrix method is used to determine the shape of the part by simultaneous solution of constraint equations. A method for increasing the speed and efficiency of the solution procedure is described. The method uses the relationships between the geometry and constraints to minimize the number of equations and variables to be solved.
V. C. Lin, David C. Gossard, R. A. Light
SIGGRAPH2