102291 search results - page 77 / 20459 » Computability in Computational Geometry |
147
click to vote
COMPGEOM
1994
ACM
15 years 8 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
161
click to vote
COMPGEOM
2001
ACM
15 years 8 months 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...
140
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
161
click to vote
COMPGEOM
2000
ACM
15 years 8 months ago
2000
ACM
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
148
click to vote
IMR
2000
Springer
15 years 7 months ago
2000
Springer
A new technique for automatically generating anisotropic quadrilateral meshes is presented in this paper. The inputs are (1) a 2D geometric domain and (2) a desired anisotropy