109 search results - page 9 / 22 » Computing the betti numbers of arrangements |
COMPGEOM
2001
ACM
14 years 18 days ago
2001
ACM
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
CLUSTER
2008
IEEE
14 years 3 months ago
2008
IEEE
—Multiple processors or multi-core CPUs are now in common, and the number of processes running concurrently is increasing in a cluster. Each process issues contiguous I/O request...
TVCG
2012
11 years 11 months ago
2012
—Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is ...
IMR
2005
Springer
14 years 2 months ago
2005
Springer
This paper describes an interior surface generation method and a strategy for all-hexahedral mesh generation. It is well known that a solid homeomorphic to a ball with even number...