1879 search results - page 67 / 376 » Computational geometry algorithms library |
143
click to vote
ICCS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. The complexity of virtual environments has grown spectacularly over the recent years, mainly thanks to the use of the currently cheap high performance graphics cards. As ...
125
Voted
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
139
Voted
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...
117
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
131
Voted
COMPGEOM
1997
ACM
15 years 8 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...