Matching points with circles and squaresABREGO, Bernardo M; ARKIN, Esther M; FERNANDEZ-MERCHANT, Silvia et al.Lecture notes in computer science. 2005, pp 1-15, issn 0302-9743, isbn 3-540-30467-3, 1Vol, 15 p.Conference Paper

I/O-efficiently pruning dense spannersGUDMUNDSSON, Joachim; VAHRENHOLD, Jan.Lecture notes in computer science. 2005, pp 106-116, issn 0302-9743, isbn 3-540-30467-3, 1Vol, 11 p.Conference Paper

Sliding disks in the planeBEREG, Sergey; DUMITRESCU, Adrian; PACH, Janos et al.Lecture notes in computer science. 2005, pp 37-47, issn 0302-9743, isbn 3-540-30467-3, 1Vol, 11 p.Conference Paper

Mapping graphs on the sphere to the finite planeBEKKER, Henk; DE RAEDT, Koen.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-43591-3, 3Vol, vol. 3, 55-64Conference Paper

Applied computational Geometry : AbstractDOBKIN, D. P.Lecture notes in computer science. 1997, issn 0302-9743, isbn 3-540-63307-3, p. 185Conference Paper

Computational geometry (SCG'06) (June 5-7, 2006, Sedona AZ)SCG : symposium on computational geometry. 2006, isbn 1-59593-340-9, 1Vol, XI-488 p, isbn 1-59593-340-9Conference Proceedings

Discrete and computational geometry (Japanese conference, JCDCG 2004)Akiyama, Jin; Kano, Mikio.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-30467-3, 1Vol, VIII-212 p, isbn 3-540-30467-3Conference Proceedings

Shape AlgorithmicsVELTKAMP, Remco C.Algorithmica. 2004, Vol 38, Num 1, issn 0178-4617, 268 p.Serial Issue

On approximating the smallest enclosing bregman ballsNIELSEN, Frank; NOCK, Richard.SCG : symposium on computational geometry. 2006, pp 485-486, isbn 1-59593-340-9, 1Vol, 2 p.Conference Paper

Amorphous geometryD'HONDT, Ellie; D'HONDT, Theo.Lecture notes in computer science. 2001, pp 645-648, issn 0302-9743, isbn 3-540-42567-5Conference Paper

Pre-triangulations and liftable complexesAICHHOLZER, Oswin; AURENHAMMER, Franz; HACKL, Thomas et al.SCG : symposium on computational geometry. 2006, pp 282-291, isbn 1-59593-340-9, 1Vol, 10 p.Conference Paper

Discrepancy theory and computational geometryCHAZELLE, B.Lecture notes in computer science. 1997, pp 1-2, issn 0302-9743, isbn 3-540-63307-3Conference Paper

A fast 2D shape interpolation techniqueLIN, Ping-Hsien; LEE, Tong-Yee.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-25860-4, 4Vol, part III, 1050-1059Conference Paper

Adapting (pseudo)-triangulations with a near-linear number of edge flipsAICHHOLZER, Oswin; AURENHAMMER, Franz; KRASSER, Hannes et al.Lecture notes in computer science. 2003, pp 12-24, issn 0302-9743, isbn 3-540-40545-3, 13 p.Conference Paper

System description : GCLCprover geothmsJANICIC, Predrag; QUARESMA, Pedro.Lecture notes in computer science. 2006, pp 145-150, issn 0302-9743, isbn 3-540-37187-7, 1Vol, 6 p.Conference Paper

Restricted Mesh Simplification Using Edge ContractionsANDERSSON, Mattias; GUDMUNDSSON, Joachim; LEVCOPOULOS, Christos et al.Lecture notes in computer science. 2006, pp 196-204, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 9 p.Conference Paper

LA CONSTRUCTION DU DIAGRAMME DE DELAUNAY PAR BALAYAGE DANS LE PLAN ET SES APPLICATIONS = THE CONSTRUCTION OF THE DELAUNAY DIAGRAM USING PLANE-SWEEP TECHNIQUES AND ITS APPLICATIONSKauffmann, Pierre; Spehner, Jean Claude.1999, 268 p.Thesis

The anatomy of a geometric algorithmMATOUSEK, J.Lecture notes in computer science. 1999, pp 1-7, issn 0302-9743, isbn 3-540-66904-3Conference Paper

Checking the convexity of polytopes and the planarity of subdivisions : (Extended abstract)DEVILLERS, O; LIOTTA, G; PREPARATA, F. P et al.Lecture notes in computer science. 1997, pp 186-199, issn 0302-9743, isbn 3-540-63307-3Conference Paper

Offset-polygon annulus placement problemsBAREQUET, G; BRIGGS, A. J; DICKERSON, M. T et al.Lecture notes in computer science. 1997, pp 378-391, issn 0302-9743, isbn 3-540-63307-3Conference Paper

On piercing sets of axis-parallel rectangles and ringsSEGAL, M.Lecture notes in computer science. 1997, pp 430-442, issn 0302-9743, isbn 3-540-63397-9Conference Paper

3D interpretation of conics and orthogonalityKANATANI, K; WU LIU.CVGIP. Image understanding. 1993, Vol 58, Num 3, pp 286-301, issn 1049-9660Article

Computing optimal triangulations using simulated annealingSCHUMAKER, L. L.Computer aided geometric design. 1993, Vol 10, Num 3-4, pp 329-345, issn 0167-8396Conference Paper

Minimum Pseudo-Triangulation Using Convex Hull LayersTAHERKHANI, F; NOUROLLAH, A.Foundations of computer science. International conferenceWorldComp'2011. 2011, pp 42-46, isbn 1-60132-179-1, 5 p.Conference Paper

On the maximum number of edges in topological graphs with no four pairwise crossing edgesACKERMAN, Eyal.SCG : symposium on computational geometry. 2006, pp 259-263, isbn 1-59593-340-9, 1Vol, 5 p.Conference Paper