Author of the publication

Computing Nice Projections of Convex Polyhedra.

, and . Int. J. Comput. Geom. Appl., 21 (1): 71-85 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Fast Preemptive Task Scheduling Algorithm for Homogeneous and Heterogeneous Distributed Memory Systems., , and . SNPD, page 720-725. IEEE Computer Society, (2008)Computing Nice Projections of Convex Polyhedra., and . Int. J. Comput. Geom. Appl., 21 (1): 71-85 (2011)Cutting a Convex Polyhedron Out of a Sphere., , and . WALCOM, volume 5942 of Lecture Notes in Computer Science, page 94-101. Springer, (2010)Cutting Out Polygons with a Circular Saw., and . ISAAC, volume 7074 of Lecture Notes in Computer Science, page 230-239. Springer, (2011)On fixed size projection of simplicial polyhedra.. Inf. Process. Lett., 113 (22-24): 882-887 (2013)Some Basic Ternary Operations Using Toffoli Gates Along with the Cost of Implementation., , , , and . ISMVL, page 142-146. IEEE Computer Society, (2011)On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost., , , and . WALCOM, volume 5942 of Lecture Notes in Computer Science, page 252-262. Springer, (2010)Maximum Neighbour Voronoi Games., , and . WALCOM, volume 5431 of Lecture Notes in Computer Science, page 93-104. Springer, (2009)Cutting a Convex Polyhedron Out of a Sphere., , and . Graphs Comb., 27 (3): 307-319 (2011)Computing Nice Projections of Convex Polyhedra., and . WALCOM, volume 4921 of Lecture Notes in Computer Science, page 111-119. Springer, (2008)