1879 search results - page 58 / 376 » Computational geometry algorithms library |
110
Voted
GD
2001
Springer
15 years 8 months ago
2001
Springer
We give a characterization of DFS cotree-critical graphs which is central to the linear time Kuratowski finding algorithm implemented in PIGALE (Public Implementation of a Graph ...
134
click to vote
COMPGEOM
2007
ACM
15 years 8 months ago
2007
ACM
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...
201
click to vote
JODL
2000
15 years 3 months ago
2000
In this paper we describe the architecture and implementation of a digital library framework for scientific data, particularly imagery, with a focus on support for content-based se...
118
click to vote
VLSID
2002
IEEE
16 years 4 months ago
2002
IEEE
One of the major roadblocks in reduction of library generation cycle time is the layout generation phase. The two methods of doing automatic layout generation are synthesis and mig...
122
click to vote
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Synthesis is the automatic construction of a system from its specification. In the classical synthesis algorithms it is always assumed the system is “constructed from ...