Current status

  • “vectorization in 3D”
  • given a hex mesh, we now have a simple binary labeling for extracting a clean curve network, see this post

Questions and comments

  • David: can we restrict the hex mesh to a narrow band around the input curves? What should be the size of the narrow band? What should be the grid size?
  • objective function for extraction? Negative weights?
  • locally decide if an edge should have positive or negative weight
  • symmetric distance, similar to [Nan and Wonka 2017] or [deGoes et al. 2011] (see below)
  • Justin: this seems like a very convoluted way to get a clean curve network. Hex meshing is hard, why not just do tet meshing with alignment constraints?

ToDo

  • improve binary labeling: symmetric distance, negative weights, more general constraints
  • experiments with real data (TiltBrush)

Next meeting

  • Monday, Dec 2, 2019, 2pm/8am

[Nan and Wonka, ICCV 2017]
PolyFit

[deGoes et al. 2011]
An Optimal Transport Approach to Robust Reconstruction and Simplification of 2D Shapes

[Ni et al., SGP 2018]
Field-Aligned and Lattice-Guided Tetrahedral Meshing

[Levy and Liu, SIGGRAPH 2010]
Lp Centroidal Voronoi Tesselation and its applications