Sciweavers

30 search results - page 5 / 6
» Matroid Polytopes and their Volumes
Sort
View
COMPGEOM
2004
ACM
15 years 5 months ago
On empty convex polygons in a planar point set
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
Rom Pinchasi, Rados Radoicic, Micha Sharir
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
16 years 6 hour ago
Sublinear geometric algorithms
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
Bernard Chazelle, Ding Liu, Avner Magen
VMV
2004
123views Visualization» more  VMV 2004»
15 years 1 months ago
Hierarchy Accelerated Stochastic Collision Detection
In this paper we present a new framework for collision and self-collision detection for highly deformable objects such as cloth. It permits to efficiently trade off accuracy for s...
Stefan Kimmerle, Matthieu Nesme, François F...
NN
2002
Springer
119views Neural Networks» more  NN 2002»
14 years 11 months ago
Category regions as new geometrical concepts in Fuzzy-ART and Fuzzy-ARTMAP
In this paper we introduce novel geometric concepts, namely category regions, in the original framework of Fuzzy-ART (FA) and FuzzyARTMAP (FAM). The definitions of these regions a...
Georgios C. Anagnostopoulos, Michael Georgiopoulos
VISUALIZATION
2003
IEEE
15 years 5 months ago
Counting Cases in Marching Cubes: Toward a Generic Algorithm for Producing Substitopes
We describe how to count the cases that arise in a family of visualization techniques, including Marching Cubes, Sweeping Simplices, Contour Meshing, Interval Volumes, and Separat...
David C. Banks, Stephen A. Linton