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

Mary Pickett

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

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

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 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
Computer animation and physical simulation · 77% Geometric modeling and processing · 23%

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

TopicWeightPapersLastEvidence papers
Computer animation and physical simulation
model reduction
0.011997
Simplifying complex CAD geometry with conservative bounding contours · ICRA 1997
Geometric modeling and processing › computer-aided design
CAD model processing
0.011997
Simplifying complex CAD geometry with conservative bounding contours · ICRA 1997

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

wireframe projection · 0.0convex hull · 0.0bounding box · 0.0
YearPublicationVenuePosition
1997 Simplifying complex CAD geometry with conservative bounding contours
abstract
Megabytes of data are often required for today's detailed CAD models. Users are often willing to sacrifice some of this detail for efficient rendering, transmission over networks, and robot motion planning. For example, many robotics and automation applications such as collision checking require only the simple bounding envelope of a complex set of nested CAD models. In contrast to approximate graphics rendering, these applications require that the simplified envelope be conservative: that the true CAD model be strictly contained inside it. One conservative bounding envelope is the bounding box. Another is the convex hull. Generally each conservative bounding envelope can be "trimmed" by a conservative bounding contour (CBC) of its 2D projection. This yields a hierarchy of conservative bounding envelopes of the original CAD model. In this paper we describe a method for generating the CBC at different levels of simplification. We give an algorithm that computes the CBC of a given 2D projection of a wireframe model. Since the wireframe requires neither boundary representation (BREP) nor constructive solid geometry (CSG) our method is compatible with almost all existing CAD standards.
Kenneth Y. Goldberg, Mary Pickett
ICRA3