215 search results - page 32 / 43 » Farthest-Polygon Voronoi Diagrams |
SGP
2007
13 years 10 months ago
2007
We introduce an algorithm for reconstructing watertight surfaces from unoriented point sets. Using the Voronoi diagram of the input point set, we deduce a tensor field whose princ...
IJCAI
2003
13 years 9 months ago
2003
This paper describes a jam session system that enables a human player to interplay with virtual players which can imitate the player personality models of various human players. P...
SODA
1993
ACM
13 years 9 months ago
1993
ACM
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
COMGEO
2004
ACM
13 years 7 months ago
2004
ACM
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...