Hamiltonian triangulations for fast rendering

Lecture Notes in Computer Science 1205

Industrial Robot the international journal of robotics research and application · 1999 · 38.7K citations

Computing, Computer Science, Programming Languages +2

The Planar Hamiltonian Circuit Problem is NP-Complete

M. R. Garey, D. S. Johnson, Robert E. Tarjan · SIAM Journal on Computing · 1976 · 529 citations

Computing, Computer Science, Mathematics +7

Some NP-hard polygon decomposition problems

Joseph O’Rourke, Kenneth J. Supowit · IEEE Transactions on Information Theory · 1983 · 201 citations

Computing, Computer Science, Mathematics +13

On the convex layers of a planar set

Bernard Chazelle · IEEE Transactions on Information Theory · 1985 · 190 citations

Computing, Computer Science, Computational Geometry +9

An optimal visibility graph algorithm for triangulated simple polygons

John Hershberger · Algorithmica · 1989 · 83 citations

Computing, Computer Science, 3D Modeling +13