( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Efficient Ray Shooting and Hidden Surface Removal

, , , , и . Algorithmica, 12 (1): 30―53 (июля 1994)

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.

Jack MacLelland

Jack Anderson

Jack Kalmi

Jack Nisenbaum

Jack Coumans

 

Другие публикации лиц с тем же именем

Faster Placement of Hydrogens in Protein Structures by Dynamic Programming., , и . ALENEX/ANALC, стр. 39-48. SIAM, (2004)Path Seeds and Flexible Isosurfaces - Using Topology for Exploratory Visualization., и . VisSym, стр. 49-58. Eurographics Association, (2003)Computing contour trees in all dimensions., , и . SODA, стр. 918-926. ACM/SIAM, (2000)An Adaptive Dynamic Programming Algorithm for the Side Chain Placement Problem., , и . Pacific Symposium on Biocomputing, стр. 17-28. World Scientific, (2005)Creating a robust implementation for segment intersection by refinement: A multistage assignment that defines away degeneracies.. CCCG, стр. 309-314. Simon Fraser University, Vancouver, British Columbia, Canada, (2016)Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams., , и . Discret. Comput. Geom., 18 (4): 433-454 (1997)Counting and Cutting Cycles of Lines and Rods in Space., , , , , , и . Comput. Geom., (1991)Ununfoldable polyhedra with convex faces., , , , , и . Comput. Geom., 24 (2): 51-62 (2003)Computing Minimum Length Paths of a Given Homotopy Class., и . Comput. Geom., (1994)On the Time Bound for Convex Decomposition of Simple Polygons., и . Int. J. Comput. Geom. Appl., 12 (3): 181-192 (2002)