Cite
Minimum decomposition of a digital surface into digital plane segments is NP-hard
MLA
Sivignon, Isabelle, and David Coeurjolly. “Minimum Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard.” Discrete Applied Mathematics, vol. 157, no. 3, Feb. 2009, pp. 558–70. EBSCOhost, https://doi.org/10.1016/j.dam.2008.05.028.
APA
Sivignon, I., & Coeurjolly, D. (2009). Minimum decomposition of a digital surface into digital plane segments is NP-hard. Discrete Applied Mathematics, 157(3), 558–570. https://doi.org/10.1016/j.dam.2008.05.028
Chicago
Sivignon, Isabelle, and David Coeurjolly. 2009. “Minimum Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard.” Discrete Applied Mathematics 157 (3): 558–70. doi:10.1016/j.dam.2008.05.028.