256 search results - page 8 / 52 » Short trees in polygons |
ENTCS
2006
13 years 8 months ago
2006
Motivated by the concerns of theorem-proving, we generalise the notion of proof tree to that of hierarchical proof tree. Hierarchical trees extend ordinary trees by adding partial...
WADS
2007
Springer
14 years 2 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
SI3D
1999
ACM
14 years 27 days ago
1999
ACM
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
COMPGEOM
1990
ACM
14 years 20 days ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
CICLING
2010
Springer
13 years 12 months ago
2010
Springer
"Short-text clustering" is a very important research field due to the current tendency for people to use very short documents, e.g. blogs, text-messaging and others. In s...