“Quick, Unconstrained, Approximate L-Shape Method” by Edum-Fotwe, Shepherd, Brown, Harper and Dinnis – ACM SIGGRAPH HISTORY ARCHIVES

“Quick, Unconstrained, Approximate L-Shape Method” by Edum-Fotwe, Shepherd, Brown, Harper and Dinnis

  • ©

  • ©

  • ©

Conference:


Type(s):


Entry Number: 77

Title:

    Quick, Unconstrained, Approximate L-Shape Method

Presenter(s)/Author(s):



Abstract:


    This simple paper describes an intuitive data-driven approach to reconstructing architectural building-footprints from structured or unstructured 2D pointsets. The function is fast, accurate and unconstrained. Further unlike the prevalent L-Shape detectors predicated on a shape’s skeletal descriptor [Szeliski 2010], the method is robust to sensing noise at the boundary of a 2D pointset.

Keyword(s):



PDF:



ACM Digital Library Publication:



Overview Page:



Submit a story:

If you would like to submit a story about this presentation, please contact us: historyarchives@siggraph.org