Sciweavers

235 search results - page 13 / 47
» The Complexity of Separating Points in the Plane
Sort
View
JGTOOLS
2007
67views more  JGTOOLS 2007»
14 years 9 months ago
Unified Distance Formulas for Halfspace Fog
Abstract. In many real-time rendering applications, it is necessary to model a fog volume that is bounded by a single plane but is otherwise infinite in extent. This paper presents...
Eric Lengyel
COMPGEOM
2003
ACM
15 years 2 months ago
Morse-smale complexes for piecewise linear 3-manifolds
We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and ascending manifolds of all critical points. In the generic case, its ...
Herbert Edelsbrunner, John Harer, Vijay Natarajan,...
ALT
1998
Springer
15 years 1 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh
COMPGEOM
2009
ACM
15 years 4 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan
82
Voted
COMPGEOM
2009
ACM
15 years 4 months ago
On the topology of planar algebraic curves
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
Jinsan Cheng, Sylvain Lazard, Luis Mariano Pe&ntil...