scispace - formally typeset
D

Dinesh Manocha

Researcher at University of Maryland, College Park

Publications -  959
Citations -  40770

Dinesh Manocha is an academic researcher from University of Maryland, College Park. The author has contributed to research in topics: Computer science & Collision detection. The author has an hindex of 87, co-authored 874 publications receiving 35462 citations. Previous affiliations of Dinesh Manocha include Institute for Simulation and Training & Stanford University.

Papers
More filters
Proceedings ArticleDOI

OBBTree: a hierarchical structure for rapid interference detection

TL;DR: A data structure and an algorithm for efficient and exact interference detection amongst complex models undergoing rigid motion that can robustly and accurately detect all the contacts between large complex geometries composed of hundreds of thousands of polygons at interactive rates are presented.
Book ChapterDOI

Reciprocal n-Body Collision Avoidance

TL;DR: This paper presents a formal approach to reciprocal n-body collision avoidance, where multiple mobile robots need to avoid collisions with each other while moving in a common workspace, and derives sufficient conditions for collision-free motion by reducing the problem to solving a low-dimensional linear program.
Proceedings ArticleDOI

Reciprocal Velocity Obstacles for real-time multi-agent navigation

TL;DR: This paper applies the "Reciprocal Velocity Obstacle" concept to navigation of hundreds of agents in densely populated environments containing both static and moving obstacles, and shows that real-time and scalable performance is achieved in such challenging scenarios.
Proceedings ArticleDOI

I-COLLIDE: an interactive and exact collision detection system for large-scale environments

TL;DR: An exact and interactive collision detection system for large-scale environments, I-COLLIDE, based on pruning multiple-object pairs using bounding boxes and performing exact collision detection between selected pairs of polyhedral models.
Proceedings ArticleDOI

Simplification envelopes

TL;DR: The idea of simplification envelopes for generating a hierarchy of level-of-detail approximations for a given polygonal model is proposed and guarantees that all points of an approximation are within a user-specifiable distance from the original model.