2877 search results - page 33 / 576 » The Complexity of Planarity Testing |
CCCG
2008
13 years 10 months ago
2008
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...
HAPTICS
2002
IEEE
14 years 1 months ago
2002
IEEE
A novel interactive virtual needle insertion simulation is presented. Simulation models are based upon planar tissue deformations and forces measured during needle insertion exper...
GC
2007
Springer
13 years 9 months ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
ICALP
2003
Springer
14 years 2 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...