MSRI- Mathematical Foundations of Geometric Algorithms
-
Title: Geometric computing with uncertain, missing, or overabundant data
Speaker:
Link:
-
Title: Progressive simplification of tetrahedral meshes preserving all isosurface topologies
Speaker:
Link:
-
Title: Learning about manifolds from samples
Speaker:
Link:
-
Title: Binary space partitions
Speaker:
Link:
-
Title: Approximation algorithms for diameter, width, and related problems
Speaker:
Link:
-
Title: Protein shape descriptors
Speaker:
Link:
-
Title: Capturing topological and geometric features of molecular surfaces for protein docking
Speaker:
Link:
-
Title: Bipartite perfect matching in the plane
Speaker:
Link:
-
Title: Monotone paths in line arrangements with a small number of directions
Speaker:
Link:
-
Title: Output-sensitive construction of the union of triangles
Speaker:
Link:
-
Title: How to compute the volume?
Speaker:
Link:
-
Title: Efficient algorithms for bichromatic separability
Speaker:
Link:
-
Title: Computational complexity of stabbing, visibility and radii computations
Speaker:
Link:
-
Title: Bernstein basis and real rool isolation
Speaker:
Link:
-
Title: Linear algebra and LP-type problems
Speaker:
Link:
-
Title: Problems on the interface of geometry and economics
Speaker:
Link:
-
Title: What is new with kinetic data structures?
Speaker:
Link:
-
Title: On some geometric optimal path and network problems problems
Speaker:
Link:
-
Title: On core sets and shape fitting in high dimensions
Speaker:
Link:
-
Title: Geometric approximation using core sets
Speaker:
Link: