Fast and exact mesh booleans, spatial queries, arrangements, registration, and remeshing. Composable algorithms on your data — zero-copy views, reusable spatial trees, first-class topology.

This study addresses the challenges of anatomical diversity and precision in orthopedic surgery by introducing a novel computational methodology for designing customized osteosynthesis plates. The ...

MAtCha Gaussians reconstruction from 10 input views. We provide a dedicated script for each of these steps, as well as a script train.py that runs the entire pipeline. We explain how to use this ...

The difficulties of algorithmic dynamics in highly nonconvex landscapes are central in several research areas, from hard combinatorial optimization to machine learning. However, it is unclear why and ...

Abstract: This paper presents a new pipelined hardware architecture for the computation of the real-valued fast Fourier transform (RFFT). The proposed architecture takes advantage of the reduced ...

Forward-looking imaging for maneuvering platforms has garnered significant interest in many military and civilian fields. As the maneuvering trajectory in the scanning period can be simplified as the ...

Abstract: This paper introduces an algorithm for rapid progressive simplification of tetrahedral meshes: TetFusion. We describe how a simple geometry decimation operation steers a rapid and controlled ...

The problem of optimizing over random structures emerges in many areas of science and engineering, ranging from statistical physics to machine learning and artificial intelligence. For many such ...

Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances.