Curvature Variation Based Sampling for Delaunay Triangulations of Manifolds
Explore adaptive sampling for Delaunay triangulations of Riemannian manifolds, focusing on curvature variation and quality bounds for successful triangulation. Learn about geometric realizations and manifold triangulation techniques.
Graph-Based Approximate Nearest Neighbors and HNSW
Explore graph-based algorithms for efficient nearest neighbor search, focusing on HNSW. Learn advantages, construction, and practical applications in large-scale search solutions.
Skeletonization Algorithms With Theoretical Guarantees for Point Clouds
Explore skeletonization algorithms for point clouds, including Mapper, alpha-Reeb graphs, and Homologically Persistent Skeleton. Compare their performance on synthetic and real data sets.
Algorithmic Motion Planning Meets Min-Invasive Robotic Surgery
Explores algorithmic motion planning for minimally-invasive surgical robots, focusing on efficient planning methods with provable guarantees to enhance safety and effectiveness in medical procedures.
How Computers Draw Weird Shapes - Marching Squares Algorithm
Explore the fascinating world of computer graphics, focusing on the Marching Squares algorithm for rendering complex shapes like metaballs. Learn about implicit functions, optimization techniques, and 3D extensions.
Near Linear Time Approximation Schemes for Clustering in Doubling Metrics
Explore efficient approximation algorithms for clustering problems in doubling metrics, focusing on near-linear time solutions and their theoretical foundations.
Truly Optimal Euclidean Spanners
Explore optimal Euclidean spanners, their construction, and applications in computational geometry and network design. Gain insights from experts Hung Le and Shay Solomon.
Strings and Geometry in Computer Science - Session 6C
Explore advanced concepts in strings and geometry, focusing on cutting-edge research and applications in computer science and mathematics.
A Geometry Engine from First Principles - Building CAM Software for 3D Printing
Explore the journey of building a geometry engine for 3D printing from scratch, delving into unique mathematical approaches and innovative algorithms while avoiding existing geometry kernels.
Tight Bounds for Volumetric Spanners in All Norms
Explores optimal bounds for volumetric spanners across all norms, discussing applications in optimization and matrix approximation. Presents a local search method for construction and its implications for coresets in MVEE problems.
Optimizing a Ray Tracer by Building a Bounding Volume Hierarchy (BVH)
Optimize ray tracing performance by building a Bounding Volume Hierarchy (BVH). Learn techniques like GPU-friendly data structures, iterative traversal, and surface area heuristics to render complex scenes efficiently.
Weighted Voronoi Stippling Algorithm Implementation - Coding Challenge
Learn to implement weighted Voronoi stippling in p5.js, exploring Delaunay triangulation, Voronoi diagrams, and Lloyd's algorithm to create stunning dot-based images with artistic techniques.
Coresets and Their Applications to Design Sublinear Algorithms
Explore coresets and their role in designing efficient sublinear algorithms, enhancing computational performance for large-scale data analysis and machine learning tasks.
Extension Complexity of Random Polytopes
Explores extension complexity of random polytopes, discussing results for fixed-dimension convex hulls of random points on unit sphere or ball. Joint work with Kwan and Zhao.
O(log s)-Approximate Nearest Neighbor Search for Earth Mover's Distance
Explore advancements in nearest neighbor search for Earth Mover's Distance, improving approximation to Õ(log s) with sublinear query time using data-dependent LSH functions and tree embedding techniques.
Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree
Efficient distributed algorithms for clustering high-dimensional data using Euclidean Minimum Spanning Tree, achieving constant factor approximation in O~(loglogn) rounds of MPC model.
Faster Polytope Rounding, Sampling, and Volume Computation via a Sublinear Ball Walk
Explore advanced algorithms for efficient polytope analysis, including rounding, sampling, and volume computation using innovative Markov chain techniques.
Sweep-Line Algorithm for Voronoi Diagrams
Efficient algorithm for computing Voronoi diagrams of points and segments, with applications in VLSI CAD and manufacturing. Covers numerical robustness, lazy-exact arithmetic, and reliable results for integer inputs.
A Generic Binary Tree - Why Grow Your Own?
Explore the design and implementation of a generic binary tree for Boost.Graph, discussing trade-offs, storage options, and performance comparisons while drawing insights from classic computer science texts.
STL Algorithms as Expressions
Explore advanced C++ techniques using Expression Templates for flexible algorithm customization, enhancing STL range algorithms and generic programming beyond traditional approaches.
Seven Things Every Python Programmer Should Know
Discover essential Python techniques for reliable, efficient, and maintainable code. Explore idiomatic practices, avoid common pitfalls, and enhance your programming skills.