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

Mark A. Abramson

dblp:59/1769 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2022
0000-0002-2556-2654ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 1 since 2021

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
Geometric modeling and processing · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing
collision detection
0.612022
Penetration Depth Between Two Convex Polyhedra: An Efficient Stochastic Global Optimization Approach · IEEE Trans. Vis. Comput. Graph. 2022
Geometric modeling and processing › collision detection
penetration depth computation
0.612022
Penetration Depth Between Two Convex Polyhedra: An Efficient Stochastic Global Optimization Approach · IEEE Trans. Vis. Comput. Graph. 2022
Mathematical optimization
global optimization
0.212022
Penetration Depth Between Two Convex Polyhedra: An Efficient Stochastic Global Optimization Approach · IEEE Trans. Vis. Comput. Graph. 2022

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

stochastic multistart · 1.1nonsmooth optimization · 1.1constrained global optimization · 1.1
YearPublicationVenuePosition
2022 Penetration Depth Between Two Convex Polyhedra: An Efficient Stochastic Global Optimization Approach
abstract
During the detailed design phase of an aerospace program, one of the most important consistency checks is to ensure that no two distinct objects occupy the same physical space. Since exact geometrical modeling is usually intractable, geometry models are discretized, which often introduces small interferences not present in the fully detailed model. In this paper, we focus on computing the depth of the interference, so that these false positive interferences can be removed, and attention can be properly focused on the actual design. Specifically, we focus on efficiently computing the penetration depth between two polyhedra, which is a well-studied problem in the computer graphics community. We formulate the problem as a constrained five-variable global optimization problem, and then derive an equivalent unconstrained, two-variable nonsmooth problem. To solve the optimization problem, we apply a popular stochastic multistart optimization algorithm in a novel way, which exploits the advantages of each problem formulation simultaneously. Numerical results for the algorithm, applied to 14 randomly generated pairs of penetrating polytopes, illustrate both the effectiveness and efficiency of the method.
Mark A. Abramson, Griffin D. Kent, Gavin W. Smith
IEEE Trans. Vis. Comput. Graph.1
2008 Quantitative Object Reconstruction Using Abel Transform X-Ray Tomography and Mixed Variable Optimization
abstract
This paper introduces a new approach to the problem of quantitative reconstruction of an object from few radiographic views. A mixed variable programming problem is formulated in which the variables of interest are the number and types of materials and geometric parameters. To demonstrate the technique, we considered the problem of reconstructing cylindrically symmetric objects of multiple layers from a single radiograph. The mixed variable pattern search algorithm for linearly constrained problems was applied by means of the NOMADm MATLAB software package. Numerical results are presented for several test configurations and show that, while there are difficulties yet to be overcome, the method is promising for solving this class of problems.
Mark A. Abramson, Thomas J. Asaki, John E. Dennis, Kevin R. O'Reilly, Rachael L. Pingel
SIAM J. Imaging Sci.1