y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto

#computational-geometry News & Analysis

4 articles tagged with #computational-geometry. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

4 articles
AINeutralarXiv – CS AI · Jun 85/10
🧠

A Geometric Gaussian Mixture Representation of Plane Curves

Researchers introduce a Gaussian Mixture Model (GMM) framework that represents plane curves as probabilistic geometric primitives, encoding both tangential and normal uncertainty. This mathematical approach enables uncertainty-aware geometric modeling applicable to CAD, robotics, and digital twin applications.

AINeutralarXiv – CS AI · Jun 26/10
🧠

Geodesics with Unified Tangent-constrained Priors and Curvature Regularization

Researchers propose a unified geodesic framework that combines tangent-constrained priors with curvature regularization to improve image segmentation accuracy. The method addresses limitations in existing models by enforcing shape-aware constraints through orientation-lifted spaces, achieving robust segmentation with enhanced shape fidelity on medical and natural images.

AINeutralarXiv – CS AI · Jun 26/10
🧠

ShapeLib: Designing a library of programmatic 3D shape abstractions with Large Language Models

ShapeLib is a new method that leverages Large Language Models to automatically design libraries of reusable 3D shape abstractions from user-provided descriptions and exemplar shapes. The system validates these abstractions through geometric reasoning and develops recognition networks that generalize across shape distributions, enabling interpretable programmatic interfaces for 3D modeling tasks.

AINeutralarXiv – CS AI · May 115/10
🧠

Fast and Effective Redistricting Optimization via Composite-Move Tabu Search

Researchers present CM-Tabu, a composite-move Tabu search algorithm that solves spatial redistricting optimization problems more effectively by expanding the feasible solution space while maintaining district contiguity constraints. The method uses graph analysis to identify minimal unit movements or swaps that preserve connectivity, achieving superior solution quality and computational efficiency compared to traditional approaches.