SearcharxivSearch

arXiv subjects

Alice Petrov

Publications and source records attributed to Alice Petrov.

3 recordsLinked to original sources

Tangent Blow-Ups for Processing Non-Manifold Geometry

Many geometry processing pipelines implicitly assume their input data is a manifold, or is sampled from one, with a unique tangent plane at every point. Geometric data, however, routinely contains sharp features like edges, corners, self-intersections, branching junctions, and other singularities, rendering standard methods ill-defined at these points. To bring geometry processing to these and other singular spaces, we introduce the ``tangent blow-up,'' a representation inspired by algebraic geometry that restores structure at singularities by lifting to the product of the ambient space and the Grassmannian of tangent planes. After iterating this construction, points that coincide in position but differ in tangent direction, curvature, or higher-order contact become well-separated. We equip the tangent blow-up with a product metric and define discretized differential operators, such as the gradient, divergence, and Laplacian, directly in the lifted domain. We demonstrate our framework across geodesic computation, segmentation, surface parameterization, and curvature estimation.

cs.GR

The Essence of de Rham Cohomology

The study of differential forms that are closed but not exact reveals important information about the global topology of a manifold, encoded in the de Rham cohomology groups $H^k(M)$, named after Georges de Rham (1903-1990). This expository paper provides an explanation and exploration of de Rham cohomology and its equivalence to singular cohomology. We present an intuitive introduction to de Rham cohomology and discuss four associated computational tools: the Mayer-Vietoris theorem, homotopy invariance, Poincaré duality, and the Künneth formula. We conclude with a statement and proof of de Rham's theorem, which asserts that de Rham cohomology is equivalent to singular cohomology.

math.AT

Automated Planning Techniques for Elementary Proofs in Abstract Algebra

This paper explores the application of automated planning to automated theorem proving, which is a branch of automated reasoning concerned with the development of algorithms and computer programs to construct mathematical proofs. In particular, we investigate the use of planning to construct elementary proofs in abstract algebra, which provides a rigorous and axiomatic framework for studying algebraic structures such as groups, rings, fields, and modules. We implement basic implications, equalities, and rules in both deterministic and non-deterministic domains to model commutative rings and deduce elementary results about them. The success of this initial implementation suggests that the well-established techniques seen in automated planning are applicable to the relatively newer field of automated theorem proving. Likewise, automated theorem proving provides a new, challenging domain for automated planning.

cs.AI