Result 41 to 60 of 885 total
Watchman tours for polygons with holes. (English)
Comput. Geom. 45, No. 7, 326-333 (2012).
41
Compact and low delay routing labeling scheme for unit disk graphs. (English)
Comput. Geom. 45, No. 7, 305-325 (2012).
42
The class cover problem with boxes. (English)
Comput. Geom. 45, No. 7, 294-304 (2012).
43
Querying two boundary points for shortest paths in a polygonal domain. (English)
Comput. Geom. 45, No. 7, 284-293 (2012).
44
A general rule for disk and hemisphere partition into equal-area cells. (English)
Comput. Geom. 45, No. 7, 275-283 (2012).
45
Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I. (English)
Comput. Geom. 45, No. 5-6, 258-274 (2012).
46
An improved algorithm for reconstructing a simple polygon from its visibility angles. (English)
Comput. Geom. 45, No. 5-6, 254-257 (2012).
47
Preserving geometric properties in reconstructing regions from internal and nearby points. (English)
Comput. Geom. 45, No. 5-6, 234-253 (2012).
48
An improved algorithm for Klee’s measure problem on fat boxes. (English)
Comput. Geom. 45, No. 5-6, 225-233 (2012).
49
Algorithms for the edge-width of an embedded graph. (English)
Comput. Geom. 45, No. 5-6, 215-224 (2012).
50
New constructions of SSPDs and their applications. (English)
Comput. Geom. 45, No. 5-6, 200-214 (2012).
51
Competing output-sensitive frame algorithms. (English)
Comput. Geom. 45, No. 4, 186-197 (2012).
52
Memoryless routing in convex subdivisions: Random walks are optimal. (English)
Comput. Geom. 45, No. 4, 178-185 (2012).
53
Graphs that admit right angle crossing drawings. (English)
Comput. Geom. 45, No. 4, 169-177 (2012).
54
Approximation algorithms for free-label maximization. (English)
Comput. Geom. 45, No. 4, 153-168 (2012).
55
On a class of $O(n^2)$ problems in computational geometry. (English)
Comput. Geom. 45, No. 4, 140-152 (2012).
56
Special issue: 26th annual symposium on computation geometry (SoCG 2010). Selected papers based on the presentations at the symposium, Snowbird, UT, USA, June 13‒16, 2010. (English)
Comput. Geom. 45, No. 5-6, 199-233 (2012).
57
Polynomial area bounds for MST embeddings of trees. (English)
Comput. Geom. 44, No. 9, 529-543 (2011).
58
A general approach to the analysis of controlled perturbation algorithms. (English)
Comput. Geom. 44, No. 9, 507-528 (2011).
59
Bold graph drawings. (English)
Comput. Geom. 44, No. 9, 499-506 (2011).
60
Result 41 to 60 of 885 total
Start
Contact
Print
General Help
