Symposium on Computational Geometry
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
- Engineering with Computers
- 2012
Constrained Delaunay tetrahedralizations (CDTs) are valuable for discretizing three-dimensional domains with constraints such as… (More)
Is this relevant?
Review
2011
Review
2011
- 2011
We solve a set of tasks for a general 3D-cube-lattice-based homogeneous robotic system, including self organizing —counting the… (More)
Is this relevant?
2008
2008
- Algorithmica
- 2008
In this paper we introduce a minimax model unifying several classes of single facility planar center location problems. We assume… (More)
Is this relevant?
1999
1999
- Int. J. Comput. Geometry Appl.
- 1999
Open problems from the 15th Annual ACM Symposium on Computational Geometry.Â
Is this relevant?
1996
1996
- The Computer Science and Engineering Handbook
- 1996
Computational geometry [Edelsbrunner 1987; Preparata and Shamos 1985] evolves from the classical discipline of design and… (More)
Is this relevant?
Review
1994
Review
1994
- 1994
Computational geometry concepts are often easiest to understand visually, in terms of the geometric objects they manipulate… (More)
Is this relevant?
1992
1992
- Algorithmica
- 1992
This special issue contains selected papers that are polished versions of results presented at the Sixth Annual Symposium on… (More)
Is this relevant?
1991
1991
- Symposium on Computational Geometry
- 1991
A problem stated by Agarwal, Aranov, Sharir, and Suri in the Sixth Annual Symposium on COMPUTATIONAL GEOMETRY is to find a faster… (More)
Is this relevant?
1987
1987
- Symposium on Computational Geometry
- 1987
This paper deals with the numerical problems involved in geometric computations. Our research wss very much motivated by a talk… (More)
Is this relevant?
1985
1985
- COMG
- 1985
The first symposium on computational geometry wa s held in Baltimore on June 5-7, 1985, and it drew a ver y enthusiastic response… (More)
Is this relevant?