Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Robust Kinetic Convex Hulls in 3D Umut A. Acar1
 

Summary: Robust Kinetic Convex Hulls in 3D
Umut A. Acar1
, Guy E. Blelloch2
, Kanat Tangwongsan2
, and Duru Tšurkoglu3
1
Toyota Technological Institute at Chicago (TTI-C)
2
Carnegie Mellon University
3
University of Chicago
Abstract. Kinetic data structures provide a framework for computing
combinatorial properties of continuously moving objects. Although ki-
netic data structures for many problems have been proposed, some dif-
ficulties remain in devising and implementing them, especially robustly.
One set of difficulties stems from the required update mechanisms used
for processing certificate failures--devising efficient update mechanisms
can be difficult, especially for sophisticated problems such as those in
3D. Another set of difficulties arises due to the strong assumption in the
framework that the update mechanism is invoked with a single event.

  

Source: Acar, Umut - Programming Languages and Systems Group, Max-Planck Institute for Software Systems

 

Collections: Computer Technologies and Information Sciences