Incremental penetration depth estimation between convex polytopes using dual-space expansion

No abstract is available for this paper.

• Publication year

  2004

• Venue

  IEEE Transactions on Visualization and Computer Graphics

• Publication date

  2004-03-01

• Fields of study

  Medicine, Computer Science

• Identifiers
  DOI 10.1109/TVCG.2004.1260767PMID 15384640
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar, PubMed

• No claims are published for this paper.

• No concepts are published for this paper.

• Differential geometry of curves and surfaces

  2006cited by this paper
• Convex polytopes

  2005cited by this paper
• DEEP: dual-space expansion for estimating penetration depth between convex polytopes

  2002cited by this paper
• Six-degree-of-freedom haptic display using localized contact computations

  2002cited by this paper
• Fast 3D Geometric Proximity Queries between Rigid and Deformable Models Using Graphics Hardware Acceleration

  2002cited by this paper
• Fast penetration depth computation for physically-based animation

  2002cited by this paper
• Deformed distance fields for simulation of non-penetrating flexible bodies

  2001cited by this paper
• Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition

  2001cited by this paper
• Fast and simple 2D geometric proximity queries using graphics hardware

  2001cited by this paper
• Penetration Depth of Two Convex Polytopes in 3D

  2000cited by this paper
• Accelerated proximity queries between convex polyhedra by multi-level Voronoi marching

  2000influential reference
• Six degree-of-freedom haptic display of polygonal models

  2000cited by this paper
• Computing the width of a three-dimensional point set: an experimental study

  1999cited by this paper
• Six degree-of-freedom haptic rendering using voxel sampling

  1999cited by this paper
• H-Walk: hierarchical distance computation for moving convex bodies

  1999cited by this paper
• Fast Proximity Queries with Swept Sphere Volumes

  1999cited by this paper
• V-Clip: Fast and Robust Polyhedral Collision Detection

  1998cited by this paper
• Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs

  1998cited by this paper
• Collision Detection between Geometric Models: A Survey

  1998cited by this paper
• On finding narrow passages with probabilistic roadmap planners

  1998cited by this paper
• Enhancing GJK: computing minimum and penetration distances between convex polyhedra

  1997cited by this paper
• OBBTree: a hierarchical structure for rapid interference detection

  1996cited by this paper
• Collision Detection for Interactive Graphics Applications

  1995cited by this paper
• Strategies for polyhedral surface decomposition: an experimental study

  1995cited by this paper
• Efficient randomized algorithms for some geometric optimization problems

  1995cited by this paper
• New distances for the separation and penetration of objects

  1994cited by this paper
• Computing the intersection-depth of polyhedra

  1993cited by this paper
• Diameter, width, closest line pair, and parametric searching

  1992cited by this paper
• A fast algorithm for incremental distance calculation

  1991cited by this paper
• The R*-tree: an efficient and robust access method for points and rectangles

  1990cited by this paper
• Dynamic simulation of autonomous legged locomotion

  1990cited by this paper
• Linear programming and convex hulls made easy

  1990cited by this paper
• Collision Detection and Response for Computer Animation

  1988cited by this paper
• Computing the Width of a Set

  1988influential reference
• A fast procedure for computing the distance between complex objects in three-dimensional space

  1988influential reference
• Computing convolutions by reciprocal search

  1986cited by this paper
• Determining the minimum translational distance between two convex polyhedra

  1986cited by this paper
• Primitives for the manipulation of general subdivisions and the computation of Voronoi

  1983cited by this paper
• Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams

  1983cited by this paper
• A new linear algorithm for intersecting convex polygons

  1982cited by this paper
• Differential geometry of curves and surfaces

  1976cited by this paper
• Differential Geometry of Curves and Surfaces

  1952cited by this paper
• Proximity Queries and Penetration Depth Computation on 3d Game Objects

  year unknowninfluential reference

• A discrete particle model considering particle shape and its simulation study of isolated draw

  2025cites this paper
• An Iterative Compression Method for the Two-Dimensional Irregular Packing Problem With Lead Lines

  2024cites this paper
• 3D Virtual reconstruction of asphalt mixture microstructure based on rigid body dynamic simulation

  2023influential citation
• An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry

  2023cites this paper
• Efficient Incremental Penetration Depth Estimation between Convex Geometries

  2023influential citation
• Penetration Depth Between Two Convex Polyhedra: An Efficient Stochastic Global Optimization Approach

  2021cites this paper
• A Review of Methods to Compute Minkowski Operations for Geometric Overlap Detection

  2020cites this paper
• Title An iterated local search algorithm based on nonlinearprogramming for the irregular strip packing problem

  2019cites this paper
• Non-Linear Regression Method for Instability Problems in Haptic Rendering System

  2019cites this paper
• A Penetration Metric for Deforming Tetrahedra using Object Norm

  2019cites this paper
• Globally Optimal Grasp Planning using a Two-Stage Branch-And-Bound Algorithm

  2019cites this paper
• New Formulation of Mixed-Integer Conic Programming for Globally Optimal Grasp Planning

  2019cites this paper
• Penalty-based haptic rendering technique on medicinal healthy dental detection

  2017cites this paper
• Detecting the intersection of two convex shapes by searching on the 2-sphere

  2017cites this paper
• An example-based approach to 3D man-made object reconstruction from line drawings

  2016cites this paper
• Data analysis on virtual stiffness in 6DoFs haptic rendering system

  2016cites this paper
• Haptic rendering method based on generalized penetration depth computation

  2016cites this paper
• Packing curved objects with interval methods

  2016cites this paper
• Continuous penetration depth computation for rigid models using dynamic Minkowski sums

  2016cites this paper
• Hybrid penetration depth computation using local projection and machine learning

  2015cites this paper
• Packing Curved Objects

  2015cites this paper
• Real-time control of a force feedback haptic interface via EtherCAT fieldbus

  2015cites this paper
• Interactive generalized penetration depth computation for rigid and articulated models using object norm

  2014cites this paper
• Six-degree-of-freedom haptic rendering using translational and generalized penetration depth computation

  2013cites this paper
• New Geometric Data Structures for Collision Detection and Haptics

  2013cites this paper
• Sphere Packings for Arbitrary Objects

  2013cites this paper
• An emergent computation approach to the problem of polygon layout with performance constraints

  2013cites this paper
• Inner Sphere Trees

  2013cites this paper
• A Brief Overview of Collision Detection

  2013cites this paper
• Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem

  2012cites this paper
• PolyDepth: Real-time penetration depth computation using iterative contact-space projection

  2012cites this paper
• Minimizing the error of linear separators on linearly inseparable data

  2012cites this paper
• Title Determining the directional contact range of two convexpolyhedra

  2011cites this paper
• Title Determining the directional contact range of two convexpolyhedra

  2011cites this paper
• Simple and parallel proximity algorithms for general polygonal models

  2010cites this paper
• Determining the directional contact range of two convex polyhedra

  2010cites this paper
• Animating cartoon faces by multi-view drawings

  2010cites this paper
• Analysis of collision detection algorithms in haptic environments

  2010influential citation
• Measuring the error of linear separators on linearly inseparable data

  2009cites this paper
• A First Approach to Contact-Based Biometrics for User Authentication

  2009cites this paper
• An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem

  2009cites this paper
• Nonlinear programming based algorithms to cutting and packing problems

  2009cites this paper
• Activity-related biometric authentication

  2008cites this paper
• Implementing a Multiparty Support in a Tour Guide system with an Embodied Conversational Agent

  2008cites this paper
• Inner Sphere Trees and Their Application to Collision Detection

  2008cites this paper
• Hybrid Metaheuristics for Packing Problems

  2008cites this paper
• MATHEMATICAL ENGINEERING TECHNICAL REPORTS Solving the Irregular Strip Packing Problem via Guided Local Search for Overlap Minimization

  2008cites this paper
• Determining Directional Contact Range of Two Convex Polyhedra

  2008cites this paper
• Exploring Different Coherence Dimensions to Answer Proximity Queries for Convex Polyhedra

  2007cites this paper
• Incremental Convex Minimization for Computing Collision Translations of Convex Polyhedra

  2007cites this paper
• MATHEMATICAL ENGINEERING TECHNICAL REPORTS Hybrid Metaheuristics for Packing Problems

  2007cites this paper
• Incremental Convex Minimization for Computing Collision Translations of Convex Polyhedra

  2007cites this paper
• Consistent collision and self-collision handling for deformable objects

  2007cites this paper
• Interacting Deformable Objects

  2006cites this paper
• High Fidelity Haptic Rendering

  2006cites this paper
• Exact collision detection of scaled convex polyhedral objects with inner ellipsoidal bounds

  2006cites this paper
• Fast Penetration Depth Computation and its Applications

  2006cites this paper
• Line-Triangle Test for Collision Detection and Response in Soft Bodies

  2006cites this paper
• Computing the Minimum Directional Distance between Two Convex Polyhedra

  2006cites this paper
• Exploiting perception in high-fidelity virtual environments (Additional presentations from the 24th course are available on the citation page)

  2006cites this paper
• A performance comparison of three algorithms for proximity queries relative to convex polyhedra

  2006cites this paper
• Contact tracking in configuration space for haptic rendering purposes

  2005cites this paper
• Consistent penetration depth estimation for deformable collision response

  2004cites this paper
• A Survey on Techniques for Computing Penetration Depth

  year unknowncites this paper