International Journal of Computational Geometry and Applications v.21 n.1 2011

ISSN 0218-1959

EXISTENCE AND COMPUTATION OF TOURS THROUGH IMPRECISE POINTS MAARTEN LÖFFLER DOI No: 10.1142/S0218195911003524  Page: 1-24      Abstract | Full Text (PDF, 384KB) | References

ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS PROSENJIT BOSE, MERCÈ MORA, CARLOS SEARA and SAURABH SETHIA DOI No: 10.1142/S0218195911003536  Page: 25-45      Abstract | Full Text (PDF, 377KB) | References

COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION OSWIN AICHHOLZER, FRANZ AURENHAMMER, THOMAS HACKL, BERT JÜTTLER, MARGOT RABL and ZBYNEK ŠÍR DOI No: 10.1142/S0218195911003548  Page: 47-69      Abstract | Full Text (PDF, 417KB) | References

COMPUTING NICE PROJECTIONS OF CONVEX POLYHEDRA MD. ASHRAFUL ALAM and MASUD HASAN DOI No: 10.1142/S021819591100355X  Page: 71-85      Abstract | Full Text (PDF, 267KB) | References

COMPUTING SIGNED PERMUTATIONS OF POLYGONS GREG ALOUPIS, PROSENJIT BOSE, ERIK D. DEMAINE, STEFAN LANGERMAN, HENK MEIJER, MARK OVERMARS and GODFRIED T. TOUSSAINT DOI No: 10.1142/S0218195911003561  Page: 87-100      Abstract | Full Text (PDF, 271KB) | References

A COMPLETE ALGORITHM FOR SEARCHLIGHT SCHEDULING KARL J. OBERMEYER, ANURAG GANGULI and FRANCESCO BULLO DOI No: 10.1142/S0218195911003573  Page: 101-130      Abstract | Full Text (PDF, 478KB) | References