Results 241 to 250 of about 822,340 (280)

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

Algebraic computation in geometry

Mathematics and Computers in Simulation, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

The computational geometry column

Bull. EATCS, 2020
The computational complexity of many problems involves the logarithmic function. The frequency of the occurrence of this phenomenon by a natural way provokes the question ``Why is it that some complexity functions are common and some are not ?] The author tries to give a partial answer by discussing various aspects of this phenomenon, namely - when the
openaire   +3 more sources

Computational Geometry

2004
No abstract.
Berg, de, M., Speckmann, B.
openaire   +2 more sources

Optical Computational Geometry

1993
The thesis is devoted to developing optical algorithms for solving problems in computational geometry. An optical model of computation is proposed, in which most classical problems of computational geometry can be solved in O(1) time.
openaire   +2 more sources