Sciweavers

COMPUTING
2004
172views more  COMPUTING 2004»
13 years 11 months ago
The Convex Hull of Freeform Surfaces
We present an algorithm for computing the convex hull of freeform rational surfaces. The convex hull problem is reformulated as one of finding the zero-sets of polynomial equation...
Joon-Kyung Seong, Gershon Elber, John K. Johnstone...
FAW
2010
Springer
259views Algorithms» more  FAW 2010»
14 years 3 days ago
Adaptive Algorithms for Planar Convex Hull Problems
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper ...
Hee-Kap Ahn, Yoshio Okamoto
ALENEX
2007
126views Algorithms» more  ALENEX 2007»
14 years 14 days ago
0/1 Vertex and Facet Enumeration with BDDs
In polyhedral studies of 0/1 polytopes two prominent problems exist. One is the vertex enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points. Anot...
Markus Behle, Friedrich Eisenbrand