Editing Hamiltonian path problem (section)

=== Computer graphics ===
[[Rendering (computer graphics)|Rendering]] engines are a form of [[software]] used in [[computer graphics]] to generate images or models from input data.<ref>{{Cite web |last1=Garsiel |first1=Tali |last2=Irish |first2=Paul |date=August 5, 2011 |title=How Browsers Work |url=https://web.dev/howbrowserswork/}}</ref>  In [[Three-dimensional space|three dimensional]] graphics rendering, a common input to the engine is a [[polygon mesh]]. The time it takes to render the object is dependent on the rate at which the input is received, meaning the larger the input the longer the rendering time. For triangle meshes, however, the rendering time can be decreased by up to a factor of three. This is done through "ordering the triangles so that consecutive triangles share a face."<ref>{{Cite journal |last1=Arkin |first1=Esther M. |last2=Mitchell |first2=Joseph S. B. |last3=Held |first3=Martin |last4=Skiena |first4=Steven S. |title=Hamiltonian Triangulations for Fast Rendering |url=https://www3.cs.stonybrook.edu/~stripe/compgeompaper.pdf |journal=Department of Computer Science Stony Brook University}}</ref> That way, only one vertex changes between each consecutive triangle. This ordering exists if the [[dual graph]] of the triangular mesh contains a Hamiltonian path.