kw.\*:("Computational geometry")
Results 1 to 25 of 3152
Selection :
A near-quadratic algorithm for the alpha-connected two-center problemHUANG, Po-Hsueh; TSAI, Yin-Te; TANG, Chuan-Yi et al.Journal of information science and engineering. 2006, Vol 22, Num 6, pp 1317-1324, issn 1016-2364, 8 p.Article
Sweeping PointsDUMITRESCU, Adrian; MINGHUI JIANG.Algorithmica. 2011, Vol 60, Num 3, pp 703-717, issn 0178-4617, 15 p.Article
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
Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problemDEHNE, F; GUIMARAES, K.Information processing letters. 1997, Vol 64, Num 3, pp 107-114, issn 0020-0190Article
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
The space-optimal version of a known rectangle enclosure reporting algorithmBOZANIS, P; KITSIOS, N; MAKRIS, C et al.Information processing letters. 1997, Vol 61, Num 1, pp 37-41, issn 0020-0190Article
An incremental computation of convex hull of planar line intersectionsBOREDDY, J.Pattern recognition letters. 1990, Vol 11, Num 8, pp 541-543, issn 0167-8655Article
A tight lower bound for the complexity of path-planning for a discO'DUNLAING, C.Information processing letters. 1988, Vol 28, Num 4, pp 165-170, issn 0020-0190Article
The ultimate planar convex hull alorithm?KIRKPATRICK, D. G; SEIDEL, R.SIAM journal on computing (Print). 1986, Vol 15, Num 1, pp 287-299, issn 0097-5397Article
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
Free-form die-cavity pocketingPARK, S. C; CHOI, B. K.International journal, advanced manufacturing technology. 2003, Vol 22, Num 11-12, pp 864-872, issn 0268-3768, 9 p.Article
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
Inscribing a symmetric body in an ellipseSANTOS, F.Information processing letters. 1996, Vol 59, Num 4, pp 175-178, issn 0020-0190Article
A note on minimal visibility graphsXIAOJUN SHEN; QING HU.Information processing letters. 1993, Vol 46, Num 2, issn 0020-0190, p. 101Article
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
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
The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawingsEADES, P; STIRK, C; WHITESIDES, S et al.Information processing letters. 1996, Vol 60, Num 2, pp 97-103, issn 0020-0190Article
Traversing the machining graph of a pocketKAI TANG; JONEJA, Ajay.Computer-aided design. 2003, Vol 35, Num 11, pp 1023-1040, issn 0010-4485, 18 p.Article
Efficiently planning compliant motion in the planeFRIEDMAN, J; HERSHBERGER, J; SNOEYINK, J et al.SIAM journal on computing (Print). 1996, Vol 25, Num 3, pp 562-599, issn 0097-5397Article
On shortest paths in polyhedral spacesMICHA SHARIR; AMIR SCHORR.SIAM journal on computing (Print). 1986, Vol 15, Num 1, pp 193-215, issn 0097-5397Article
Protecting critical facets in layered manufacturing: implementation and experimental resultsSCHWERDT, Jörg; SMID, Michiel; JANARDAN, Ravi et al.Computer-aided design. 2003, Vol 35, Num 7, pp 647-657, issn 0010-4485, 11 p.Article
Ray shooting amidst spheres in three dimensions and related problemsMOHABAN, S; SHARIR, M.SIAM journal on computing (Print). 1997, Vol 26, Num 3, pp 654-674, issn 0097-5397Article