BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Different approaches to the data skeletonization problem
DTSTART:20180313T091500
DTEND:20180313T101500
DTSTAMP:20260502T104749Z
UID:77904ce649c5b10653b37ba5d4d61ecdffc7d0e48baf1aa539da6d5c
CATEGORIES:Conferences - Seminars
DESCRIPTION:Yury Elkin (Liverpool)\nGiven a point cloud in a Euclidean spa
 ce we consider the problem of approximating the cloud by an embedded graph
  in the same space. We will review past approaches to related data skeleto
 nization problems via Reeb graphs\, Mapper algorithm and a 1-dimensional H
 omologically Persistent Skeleton. Then we will introduce a new approximate
  skeleton for detecting topological shapes of micelles in 3 dimensions. Th
 e talk is based on joint work with Vitaliy Kurlin at the University of Liv
 erpool.
LOCATION:MA 12
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR