Export Citations
Computational geometry.
- Author:
- Michael Ian Shamos
Abstract
No abstract available.
Cited By
- Wei C and Ding B (2022). Mask R-CNN-Oriented Pottery Display and Identification System, Computational Intelligence and Neuroscience, 2022, Online publication date: 1-Jan-2022.
- Rahman M, Ishii K and Noguchi N (2019). Optimum harvesting area of convex and concave polygon field for path planning of robot combine harvester, Intelligent Service Robotics, 12:2, (167-179), Online publication date: 1-Apr-2019.
- Gutiérrez G, López J, Paramá J and Penabad M (2018). The largest empty circle with location constraints in spatial databases, Knowledge and Information Systems, 55:1, (141-169), Online publication date: 1-Apr-2018.
- Das S, Nandy A and Sarvottamananda S Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints Proceedings of the Second International Conference on Algorithms and Discrete Applied Mathematics - Volume 9602, (126-138)
- Furia C, Meyer B and Velder S (2014). Loop invariants, ACM Computing Surveys, 46:3, (1-51), Online publication date: 1-Jan-2014.
- Eldawy A, Li Y, Mokbel M and Janardan R CG_Hadoop Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, (294-303)
- Gonzaga de Oliveira S A review on delaunay refinement techniques Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I, (172-187)
- Chang C, Gorissen B and Melchior S (2011). Fast oriented bounding box optimization on the rotation group SO(3,ℝ), ACM Transactions on Graphics, 30:5, (1-16), Online publication date: 1-Oct-2011.
- Acar U, Blelloch G, Blume M, Harper R and Tangwongsan K (2009). An experimental analysis of self-adjusting computation, ACM Transactions on Programming Languages and Systems, 32:1, (1-53), Online publication date: 1-Oct-2009.
- Dean A (2009). Review of visibility algorithms in the plane by Subir Kumar Ghosh (Cambridge University Press, 2007), ACM SIGACT News, 40:2, (33-35), Online publication date: 20-Jun-2009.
- Atanassov R, Bose P, Couture M, Maheshwari A, Morin P, Paquette M, Smid M and Wuhrer S (2009). Algorithms for optimal outlier removal, Journal of Discrete Algorithms, 7:2, (239-248), Online publication date: 1-Jun-2009.
- Fabbri R, Costa L, Torelli J and Bruno O (2008). 2D Euclidean distance transform algorithms, ACM Computing Surveys, 40:1, (1-44), Online publication date: 1-Feb-2008.
- Couprie M, Coeurjolly D and Zrour R (2007). Discrete bisector function and Euclidean skeleton in 2D and 3D, Image and Vision Computing, 25:10, (1543-1556), Online publication date: 1-Oct-2007.
- Acar U, Blelloch G, Blume M and Tangwongsan K An experimental analysis of self-adjusting computation Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation, (96-107)
- Acar U, Blelloch G, Blume M and Tangwongsan K (2006). An experimental analysis of self-adjusting computation, ACM SIGPLAN Notices, 41:6, (96-107), Online publication date: 11-Jun-2006.
- Roy S, Bardhan D and Das S Efficient algorithm for placing base stations by avoiding forbidden zone Proceedings of the Second international conference on Distributed Computing and Internet Technology, (105-116)
- Brönnimann H, Iacono J, Katajainen J, Morin P, Morrison J and Toussaint G (2004). Space-efficient planar convex hull algorithms, Theoretical Computer Science, 321:1, (25-40), Online publication date: 16-Jun-2004.
- Bespamyatnikh S (2002). Packing two disks in a polygon, Computational Geometry: Theory and Applications, 23:1, (31-42), Online publication date: 1-Jul-2002.
- Atwah M and Baker J An Associative Static and Dynamic Convex Hull Algorithm Proceedings of the 16th International Parallel and Distributed Processing Symposium
- Das P, Chakraborti N and Chaudhuri P (2001). Spherical Minimax Location Problem, Computational Optimization and Applications, 18:3, (311-326), Online publication date: 1-Mar-2001.
- Pineda L and Garza G (2000). A model for multimodal reference resolution, Computational Linguistics, 26:2, (139-193), Online publication date: 1-Jun-2000.
- Wang C and Xu Y (1999). Computing a Minimum Weight Triangulation of a Sparse Point Set, Journal of Global Optimization, 15:1, (73-83), Online publication date: 1-Jul-1999.
- Abdelguerfi M, Cooper E, Shaw K, Wynne C, Miller V, Broome R and Ray B A terrain database representation based on an extended vector product format (EVPF) Proceedings of the fifth international conference on Information and knowledge management, (27-33)
- Gupta N and Sen S Faster output-sensitive parallel convex hulls for d≤3 Proceedings of the twelfth annual symposium on Computational geometry, (176-185)
- Balakrishnan A and Brown S (1996). Process Planning for Aluminum Tubes, Operations Research, 44:1, (7-20), Online publication date: 1-Feb-1996.
- Ruiz S. O and Ferreira P Algebraic geometry and group theory in geometric constraint satisfaction Proceedings of the international symposium on Symbolic and algebraic computation, (224-233)
- Hyslop G and Lamagna E Error free incremental construction of Voronoi diagrams in the plane Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, (388-396)
- Liu J and Zheng S A simplified optimal algorithm for constructing the convex hull of a simple polygon Proceedings of the 30th annual ACM Southeast Regional Conference, (453-456)
- Rajan V Optimality of the Delaunay triangulation in Rd Proceedings of the seventh annual symposium on Computational geometry, (357-363)
- Bhattacharya B, Jadhav S, Mukhopadhayay A and Robert J Optimal algorithms for some smallest intersection radius problems (extended abstract) Proceedings of the seventh annual symposium on Computational geometry, (81-88)
- de Berg M, van Kreveld M and Nilsson B Shortest path queries in rectilinear worlds of higher dimension (extended abstract) Proceedings of the seventh annual symposium on Computational geometry, (51-60)
- Monma C, Paterson M, Suri S and Yao F (1990). Computing euclidean maximum spanning trees, Algorithmica, 5:1-4, (407-419), Online publication date: 1-Jun-1990.
- Oh S and Suk M Parallel algorithms for geometric searching problems Proceedings of the 1989 ACM/IEEE conference on Supercomputing, (344-350)
- Noborio H, Fukuda S and Arimoto S (1988). Construction of the Octree Approximating a Three-Dimensional Object by Using Multiple Views, IEEE Transactions on Pattern Analysis and Machine Intelligence, 10:6, (769-782), Online publication date: 1-Nov-1988.
- Dillencourt M Toughness and Delaunay triangulations Proceedings of the third annual symposium on Computational geometry, (186-194)
- Shih Z, Chen G and Lee R (1987). Systolic algorithms to examine all pairs of elements, Communications of the ACM, 30:2, (161-167), Online publication date: 1-Feb-1987.
- Aggarwal A, Guibas L, Saxe J and Shor P A Linear time algorithm for computing the Voronoi diagram of a convex polygon Proceedings of the nineteenth annual ACM symposium on Theory of computing, (39-45)
- Clarkson K Further applications of random sampling to computational geometry Proceedings of the eighteenth annual ACM symposium on Theory of computing, (414-423)
- Bajaj C Limitations to algorithm solvability: Galois methods and models of computation Proceedings of the fifth ACM symposium on Symbolic and algebraic computation, (71-76)
- Motwani R and Raghavan P Deferred data structuring: Query-driven preprocessing for geometric search problems Proceedings of the second annual symposium on Computational geometry, (303-312)
- Dwyer R A simple divide-and-conquer algorithm for computing Delaunay triangulations in O(n log log n) expected time Proceedings of the second annual symposium on Computational geometry, (276-284)
- Lin S and Allen J Minplex—a compactor that minimizes the bounding rectangle and individual rectangles in a layout Proceedings of the 23rd ACM/IEEE Design Automation Conference, (123-130)
- Clarkson K A probabilistic algorithm for the post office problem Proceedings of the seventeenth annual ACM symposium on Theory of computing, (175-184)
- Franklin W, Akman V and Verrilli C (1985). Voronoi diagrams with barriers and on polyhedra for minimal path planning, The Visual Computer: International Journal of Computer Graphics, 1:2, (133-150), Online publication date: 1-Aug-1985.
- Chazelle B and Edelsbrunner H An improved algorithm for constructing kth-order Voronoi diagrams Proceedings of the first annual symposium on Computational geometry, (228-234)
- de Rezende P, Lee D and Wu Y Rectilinear shortest paths with rectangular barriers Proceedings of the first annual symposium on Computational geometry, (204-213)
- Boissonnat J Reconstruction of solids Proceedings of the first annual symposium on Computational geometry, (46-54)
- Houle M and Toussaint G Computing the width of a set Proceedings of the first annual symposium on Computational geometry, (1-7)
- Sharir( M and Schorr A On shortest paths in polyhedral spaces Proceedings of the sixteenth annual ACM symposium on Theory of computing, (144-153)
- Post M Minimum spanning ellipsoids Proceedings of the sixteenth annual ACM symposium on Theory of computing, (108-116)
- Chazelle B (1984). Computational Geometry on a Systolic Chip, IEEE Transactions on Computers, 33:9, (774-785), Online publication date: 1-Sep-1984.
- Fishkin K and Barsky B (1984). A family of new algorithms for soft filling, ACM SIGGRAPH Computer Graphics, 18:3, (235-244), Online publication date: 1-Jul-1984.
- Tilove R (1984). A null-object detection algorithm for constructive solid geometry, Communications of the ACM, 27:7, (684-694), Online publication date: 1-Jul-1984.
- Fishkin K and Barsky B A family of new algorithms for soft filling Proceedings of the 11th annual conference on Computer graphics and interactive techniques, (235-244)
- Guibas L and Stolfi J Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams Proceedings of the fifteenth annual ACM symposium on Theory of computing, (221-234)
- Mäntylä M and Tamminen M Localized set operations for solid modeling Proceedings of the 10th annual conference on Computer graphics and interactive techniques, (279-288)
- Mäntylä M and Tamminen M (1983). Localized set operations for solid modeling, ACM SIGGRAPH Computer Graphics, 17:3, (279-288), Online publication date: 1-Jul-1983.
- Lee D and Silio C (1982). An Optimal Illumination Region Algorithm for Convex Polygons, IEEE Transactions on Computers, 31:12, (1225-1227), Online publication date: 1-Dec-1982.
- Tamminen M and Sulonen R The excell method for efficient geometric access to data Proceedings of the 19th Design Automation Conference, (345-351)
- Bentley J, Preparata F and Faust M (1982). Approximation algorithms for convex hulls, Communications of the ACM, 25:1, (64-68), Online publication date: 1-Jan-1982.
- O'Rourke J (1981). An on-line algorithm for fitting straight lines between data ranges, Communications of the ACM, 24:9, (574-578), Online publication date: 1-Sep-1981.
- Hubschman H and Zucker S Frame-to-frame coherence and the hidden surface computation Proceedings of the 8th annual conference on Computer graphics and interactive techniques, (45-54)
- Hubschman H and Zucker S (1981). Frame-to-frame coherence and the hidden surface computation, ACM SIGGRAPH Computer Graphics, 15:3, (45-54), Online publication date: 1-Aug-1981.
- Overmars M and Leeuwen J Dynamically maintaining configurations in the plane (Detailed Abstract) Proceedings of the twelfth annual ACM symposium on Theory of computing, (135-145)
- Bentley J (1980). Multidimensional divide-and-conquer, Communications of the ACM, 23:4, (214-229), Online publication date: 1-Apr-1980.
- Brassel K and Fegeas R An algorithm for shading of regions on vector display devices Proceedings of the 6th annual conference on Computer graphics and interactive techniques, (126-133)
- Brassel K and Fegeas R (1979). An algorithm for shading of regions on vector display devices, ACM SIGGRAPH Computer Graphics, 13:2, (126-133), Online publication date: 1-Aug-1979.
- Forrest A (1978). A unified approach to geometric modelling, ACM SIGGRAPH Computer Graphics, 12:3, (264-269), Online publication date: 23-Aug-1978.
- Forrest A A unified approach to geometric modelling Proceedings of the 5th annual conference on Computer graphics and interactive techniques, (264-269)
- Bentley J and Friedman J (1978). Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces, IEEE Transactions on Computers, 27:2, (97-105), Online publication date: 1-Feb-1978.
- Shamos M Geometric complexity Proceedings of the seventh annual ACM symposium on Theory of computing, (224-233)
Please enable JavaScript to view thecomments powered by Disqus.
Recommendations
Computational geometry
Encyclopedia of Computer ScienceComputational geometry is the study of algorithmic problems involving geometry. Although the ruler and compass constructions of ancient Greek geometry were essentially algorithms for producing geometric objects, modern computational geometry begins with ...
Recent Advances in Computational Conformal Geometry
Proceedings of the 13th IMA International Conference on Mathematics of Surfaces XIIIComputational conformal geometry focuses on developing the computational methodologies on discrete surfaces to discover conformal geometric invariants. In this work, we briefly summarize the recent developments for methods and related applications in ...