Sciweavers

1730 search results - page 228 / 346
» Algebra and Computation
Sort
View
COMPGEOM
2001
ACM
15 years 8 months ago
The convex hull of ellipsoids
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
COMPGEOM
2004
ACM
15 years 9 months ago
Geodesic ham-sandwich cuts
Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m + r + b. A ham-sandwich geodesic is ...
Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, J...
CIAC
2006
Springer
278views Algorithms» more  CIAC 2006»
15 years 8 months ago
Covering a Set of Points with a Minimum Number of Lines
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
Magdalene Grantson, Christos Levcopoulos
PPSC
1997
15 years 5 months ago
Parallel Extensions to the Matrix Template Library
We present the preliminary design for a C++ template library to enable the compositional construction of matrix classes suitable for high performance numerical linear algebra comp...
Andrew Lumsdaine, Brian C. McCandless
IPL
2002
118views more  IPL 2002»
15 years 4 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...