Skip to main content
  • Home
  • Development
  • Documentation
  • Donate
  • Operational login
  • Browse the archive

swh logo
SoftwareHeritage
Software
Heritage
Archive
Features
  • Search

  • Downloads

  • Save code now

  • Add forge now

  • Help

Raw File Download

To reference or cite the objects present in the Software Heritage archive, permalinks based on SoftWare Hash IDentifiers (SWHIDs) must be used.
Select below a type of object currently browsed in order to display its associated SWHID and permalink.

  • content
content badge
swh:1:cnt:24082007777b50880c9aab976e22e6fcb9d106aa

This interface enables to generate software citations, provided that the root directory of browsed objects contains a citation.cff or codemeta.json file.
Select below a type of object currently browsed in order to generate citations for them.

  • content
(requires biblatex-software package)
Generating citation ...
# Fast Winding Numbers for Soups

Implementation of the _ACM SIGGRAPH_ 2018 paper, 

"Fast Winding Numbers for Soups and Clouds" 

Gavin Barill¹, Neil Dickson², Ryan Schmidt³, David I.W. Levin¹, Alec Jacobson¹

¹University of Toronto, ²SideFX, ³Gradient Space


_Note: this implementation is for triangle soups only, not point clouds._

## Get started with 

    git clone --recursive https://github.com/GavinBarill/fast-winding-number-soups.git

## Build the example with

    cd fast-winding-number-soups
    mkdir build
    cd build
    cmake ../
    make

## Run the example with

    ./fastwinding ../pig-head.ply ../pig-head-Q.dmat ../pig-head-W.dmat

This should create a [.dmat](http://libigl.github.io/libigl/file-formats/dmat/)
file `../pig-head-W.dmat'` containing the generalized winding number for each query
point in `../pig-head-Q.dmat`.

back to top

Software Heritage — Copyright (C) 2015–2026, The Software Heritage developers. License: GNU AGPLv3+.
The source code of Software Heritage itself is available on our development forge.
The source code files archived by Software Heritage are available under their own copyright and licenses.
Terms of use: Archive access, API— Content policy— Contact— JavaScript license information— Web API