Sciweavers

ALGORITHMICA
2000
87views more  ALGORITHMICA 2000»
13 years 7 months ago
Linear Size Binary Space Partitions for Uncluttered Scenes
We describe a new and simple method for constructing binary space partitions in arbitrary dimensions. We also introduce the concept of uncluttered scenes, which are scenes with a ...
Mark de Berg
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
13 years 11 months ago
Kinetic Collision Detection for Convex Fat Objects
We design compact and responsive kinetic data structures for detecting collisions between n convex fat objects in 3-dimensional space that can have arbitrary sizes. Our main result...
Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon,...
COMPGEOM
2010
ACM
14 years 18 days ago
Better bounds on the union complexity of locally fat objects
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
Mark de Berg