Results 271 to 280 of about 206,500 (313)

Computational geometry

ACM SIGACT News, 2001
A compendium of thirty previously published open problems in computational geometry is ...
Isabel M. Beichl, Javier Bernal, Christoph Witzgall, Francis Sullivan   +3 more
openaire   +2 more sources

Computational geometry

ACM SIGACT News, 1998
Problems presented at the open-problem session of the 14th Annual ACM Symposium on Computational Geometry are listed.
Pankaj K. Agarwal, Joseph O'Rourke
openaire   +1 more source

Computational Geometry—A Survey

IEEE Transactions on Computers, 1984
We survey the state of the art of computational geometry, a discipline that deals with the complexity of geometric problems within the framework of the analysis of algorithms. This newly emerged area of activities has found numerous applications in various other disciplines, such as computer-aided design, computer graphics, operations research, pattern
D. T. Lee, Franco P. Preparata
openaire   +2 more sources

Computational geometry on hypercube computers

Proceedings of the third conference on Hypercube concurrent computers and applications -, 1988
This paper gives hypercube algorithms for some simple problems involving geometric properties of sets of points. The properties considered emphasize aspects of convexity and domination. Efficient algorithms are given for both fine-grain and medium-grain hypercube computers.
Russ Miller, Quentin F. Stout
openaire   +1 more source

Computational geometry

ACM SIGACT News, 1988
Recent solutions of three "art gallery" problems are reported. Three related still-open problems are discussed.
openaire   +1 more source

Derandomization in Computational Geometry

Journal of Algorithms, 1996
Summary: We survey techniques for replacing randomized algorithms in computational geometry by deterministic ones with a similar asymptotic running time.
openaire   +2 more sources

A workbench for computational geometry

Algorithmica, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter Epstein, J. Kavanagh, A. Knight, J. May, T. Nguyen, Jörg-Rüdiger Sack   +5 more
openaire   +2 more sources

A computational geometry workbench

Proceedings of the sixth annual symposium on Computational geometry - SCG '90, 1990
We are constructing a workbench for computational geometry. This is intended to provide a framework for the implementation, testing, demonstration and application of algorithms in computational geometry. The workbench is being written in Smalltalk/V using an Apple Macintosh II.The object-oriented model used in Smalltalk is well-suited to algorithms ...
A. Knight, J. May, Jeff McAffer, T. Nguyen, Jörg-Rüdiger Sack   +4 more
openaire   +1 more source

Computational projective geometry

CVGIP: Image Understanding, 1991
Summary: A computational formalism is given to computer vision problems involving collinearity and concurrency of points and lines on a 2-\(D\) plane from the viewpoint of projective geometry. The image plane is regarded as a 2- \(D\) projective space, and points and lines are represented by unit vectors consisting of homogeneous coordinates, called ...
openaire   +2 more sources

Parallel computational geometry

Algorithmica, 1985
This paper contributes efficient parallel algorithms for solving some basic geometric problems. ``Efficient'' here means polylogarithmic in parallel time. All the algorithmus presented are algorithms executable in polylog depth on polynomial-size circuits. Such algorithms usually are called NC-algorithms.
Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap   +4 more
openaire   +2 more sources