×

Found 102 Documents (Results 1–100)

Cuttings. 2nd edition. (English) Zbl 1387.68249

Mehta, Dinesh P. (ed.) et al., Handbook of data structures and applications. Boca Raton, FL: Chapman & Hall/CRC (ISBN 978-1-4987-0185-3/hbk; 978-1-4987-0188-4/ebook). Chapman & Hall/CRC Computer and Information Science Series, 397-404 (2018).
MSC:  68U05 68P05
PDFBibTeX XMLCite

Algorithmic and geometric aspects of robotics. Reprint of the 1987 edition. (English) Zbl 1457.68008

Routledge Revivals. Boca Raton, FL: CRC Press (ISBN 978-1-138-20347-1/hbk; 978-1-138-20350-1/pbk; 978-1-315-47145-7/ebook). xii, 305 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI

A geometric approach to collective motion. (English) Zbl 1284.93014

Proceedings of the 26th annual symposium on computational geometry, SoCG 2010, Snowbird, UT, USA, June 13–16, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0016-2). 117-126 (2010).
PDFBibTeX XMLCite
Full Text: DOI

The geometry of flocking. (English) Zbl 1284.68589

Proceedings of the 26th annual symposium on computational geometry, SoCG 2010, Snowbird, UT, USA, June 13–16, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0016-2). 19-28 (2010).
MSC:  68U05 68T42 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Computing hereditary convex structures. (English) Zbl 1380.68389

Proceedings of the 25th annual symposium on computational geometry, SCG 2009, Aarhus, Denmark, June 8–10, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-501-7). 61-70 (2009).
PDFBibTeX XMLCite
Full Text: DOI

Markov incremental constructions. (English) Zbl 1221.68260

Proceedings of the twenty-fourth annual symposium on computational geometry 2008 (SCG’08), College Park, MD, USA, June 09–11, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-071-5). 156-163 (2008).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI Link

Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform. (English) Zbl 1301.68232

Kleinberg, Jon M. (ed.), Proceedings of the 38th annual ACM symposium on theory of computing, STOC 2006. Seattle, WA, USA, May 21–23, 2006. New York, NY: ACM Press (ISBN 1-59593-134-1). 557-563 (2006).
MSC:  68U05 68U10 94A11
PDFBibTeX XMLCite
Full Text: DOI

Online geometric reconstruction. (English) Zbl 1153.68527

Computational geometry (SCG’06). Proceedings of the twenty-second annual symposium on computational geometry 2006, Sedona, Arizona, USA, June, 05–07, 2006. New York, NY: Association for Computing Machinery (ISBN 1-59593-340-9). 386-394 (2006).
MSC:  68U05 65D18
PDFBibTeX XMLCite

Lower bounds for linear degeneracy testing. (English) Zbl 1192.68306

Proceedings of the 36th annual ACM symposium on theory of computing (STOC 2004), Chicago, IL, USA, June 13 - 15, 2004. New York, NY: ACM Press (ISBN 1-58113-852-0). 554-560, electronic only (2004).
MSC:  68Q17 68U05
PDFBibTeX XMLCite
Full Text: DOI Link

Sublinear geometric algorithms. (English) Zbl 1192.68735

Proceedings of the thirty-fifth annual ACM symposium on theory of computing (STOC 2003), San Diego, CA, USA,. New York, NY: ACM Press (ISBN 1-58113-674-9). 531-540, electronic only (2003).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI Link

The power of nonmonotonicity in geometric searching. (English) Zbl 1414.68113

Proceedings of the 18th annual symposium on computational geometry, SCG/SoCG 2002, Barcelona, Spain, June 5–7, 2002. New York, NY: Association for Computing Machinery (ACM). 88-93 (2002).
MSC:  68U05 68P10 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Lower bounds for intersection searching and fractional cascading in higher dimension. (English) Zbl 1323.68295

Proceedings of the thirty-third annual ACM symposium on theory of computing, STOC 2001. Hersonissos, Crete, Greece, July 6–8, 2001. New York, NY: ACM Press (ISBN 1-581-13349-9). 322-329 (2001).
MSC:  68Q17 68Q25 68U05
PDFBibTeX XMLCite
Full Text: DOI Link

Splitting a Delaunay triangulation in linear time. (English) Zbl 1006.68560

Meyer auf der Heide, Friedhelm (ed.), Algorithms - ESA 2001. 9th annual European symposium, Århus, Denmark, August 28-31, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2161, 312-320 (2001).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: Link

A trace bound for the hereditary discrepancy. (English) Zbl 1374.68653

Proceedings of the 16th annual symposium on computational geometry, SCG 2000, Hong Kong, China, June 12–14, 2000. New York, NY: ACM, Association for Computing Machinery (ACM). 64-69 (2000).
MSC:  68U05 52C45
PDFBibTeX XMLCite
Full Text: DOI

Discrepancy bounds for geometric set systems with square incidence matrices. (English) Zbl 0916.68171

Chazelle, Bernard (ed.) et al., Advances in discrete and computational geometry. Proceedings of the 1996 AMS-IMS-SIAM joint summer research conference on discrete and computational geometry: ten years later, South Hadley, MA, USA, July 14–18, 1996. Providence, RI: American Mathematical Society. Contemp. Math. 223, 103-107 (1999).
MSC:  68U05 68Q15
PDFBibTeX XMLCite

Advances in discrete and computational geometry. Proceedings of the 1996 AMS-IMS-SIAM joint summer research conference on discrete and computational geometry: ten years later, South Hadley, MA, USA, July 14–18, 1996. (English) Zbl 0902.00037

Contemporary Mathematics. 223. Providence, RI: American Mathematical Society (AMS). xi, 463 p. (1999).
PDFBibTeX XMLCite
Full Text: DOI

Computational geometry: a retrospective. (English) Zbl 1345.68261

Proceedings of the 26th annual ACM symposium on theory of computing, STOC ’94, Montreal, Canada, May 23–25, 1994. New York, NY: Association for Computing Machinery (ACM) (ISBN 0-89791-663-8). 75-94 (1994).
MSC:  68U05 68-02
PDFBibTeX XMLCite
Full Text: DOI

Decomposition algorithms in geometry. (English) Zbl 0807.68093

Bajaj, Chandrajit L. (ed.), Algebraic geometry and its applications. Collections of papers from Shreeram S. Abhyankar’s 60th birthday conference held at Purdue University, West Lafayette, IN, USA, June 1-4, 1990. New York: Springer-Verlag. 419-447 (1994).
MSC:  68U05 52B55
PDFBibTeX XMLCite

Improved bounds on weak \({\epsilon}\)-nets for convex sets. (English) Zbl 1310.68201

Proceedings of the 25th annual ACM symposium on theory of computing, STOC ’93. San Diego, CA, USA, May 16–18, 1993. New York, NY: Association for Computing Machinery (ACM) (ISBN 0-89791-591-7). 495-504 (1993).
MSC:  68U05 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Decomposing the boundary of a nonconvex polyhedron. (English) Zbl 1502.68304

Nurmi, Otto (ed.) et al., Algorithm theory – SWAT ’92. Third Scandinavian workshop on algorithm theory, Helsinki, Finland, July 8–10, 1992. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 621, 364-375 (1992).
MSC:  68U05 52B55 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Lower bounds on the complexity of simplex range reporting on a pointer machine (extended abstract). (English) Zbl 1425.68430

Kuich, Werner (ed.), Automata, languages and programming. 19th international colloquium, Wien, Austria, July 13–17, 1992. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 623, 439-449 (1992).
MSC:  68U05 68P05 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Computing a face in an arrangement of line segments. (English) Zbl 0800.68956

Aggarwal, Alok (ed.), Discrete algorithms. Proceedings of the 2nd annual ACM-SIAM symposium, held January 28-30, 1991, in San Francisco, CA (USA). Philadelphia, PA: SIAM. 441-448 (1991).
MSC:  68U05 68P05 68Q25
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

Software