Sciweavers

676 search results - page 63 / 136
» A Search-Free Intersection Algorithm
Sort
View
SMA
2009
ACM
134views Solid Modeling» more  SMA 2009»
14 years 4 months ago
Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
ROBOCOMM
2007
IEEE
14 years 4 months ago
Distributed adaptive sampling using bounded-errors
—This paper presents a communication/coordination/ processing architecture for distributed adaptive observation of a spatial field using a fleet of autonomous mobile sensors. O...
Kévin Huguenin, Maria-João Rendas
TAPSOFT
1997
Springer
14 years 2 months ago
Set Operations for Recurrent Term Schematizations
Abstract. Reasoning on programs and automated deduction often require the manipulation of in nite sets of objects. Many formalisms have been proposed to handle such sets. Here we d...
Ali Amaniss, Miki Hermann, Denis Lugiez
CGF
2004
165views more  CGF 2004»
13 years 9 months ago
Point Cloud Collision Detection
In the past few years, many efficient rendering and surface reconstruction algorithms for point clouds have been developed. However, collision detection of point clouds has not be...
Jan Klein, Gabriel Zachmann
CSL
2007
Springer
14 years 4 months ago
Clique-Width and Parity Games
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
Jan Obdrzálek