Related papers: Mechanization of Incidence Projective Geometry in …
Mathematical proof is undoubtedly the cornerstone of mathematics. The emergence, in the last years, of computing and reasoning tools, in particular automated geometry theorem provers, has enriched our experience with mathematics immensely.…
Recently, multiple formulations of vision problems as probabilistic inversions of generative models based on computer graphics have been proposed. However, applications to 3D perception from natural images have focused on low-dimensional…
This survey provides an exposition of a suite of techniques based on the theory of polynomials, collectively referred to as polynomial methods, which have recently been applied to address several challenging problems in statistical…
This thesis establishes new quantitative records in several problems of incidence geometry and growth. After the necessary background in Chapters 1, 2 and 3, the following results are proven. Chapter 4 gives new results in the incidence…
Geometric algebra is the natural outgrowth of the concept of a vector and the addition of vectors. After reviewing the properties of the addition of vectors, a multiplication of vectors is introduced in such a way that it encodes the famous…
An approach is shown that proves various theorems of plane geometry in an algorithmic manner. The approach affords transparent proofs of a generalization of the Theorem of Morley and other well known results by casting them in terms of…
This paper considers a framework for combinatorial variants of perpetual-scheduling problems. Given an independence system $(E,\mathcal{I})$, a schedule consists of an independent set $I_t \in \mathcal{I}$ for every time step $t \in…
In this expository article we give an introduction to Ehrhart theory, i.e., the theory of integer points in polyhedra, and take a tour through its applications in enumerative combinatorics. Topics include geometric modeling in…
This tutorial provides an exposition of a flexible geometric framework for high dimensional estimation problems with constraints. The tutorial develops geometric intuition about high dimensional sets, justifies it with some results of…
The matching of multiple objects (e.g. shapes or images) is a fundamental problem in vision and graphics. In order to robustly handle ambiguities, noise and repetitive patterns in challenging real-world settings, it is essential to take…
Artificial intelligence for scientific discovery has recently generated significant interest within the machine learning and scientific communities, particularly in the domains of chemistry, biology, and material discovery. For these…
Illumination of scenes is usually generated in computer graphics using polygonal meshes. In this paper, we present a geometric method using projections. Starting from an implicit polynomial equation of a surface in 3-D or a curve in 2-D, we…
We study a wide spectrum of incidence problems involving points and curves or points and surfaces in $\mathbb R^3$. The current (and in fact the only viable) approach to such problems, pioneered by Guth and Katz [2010,2015], requires a…
We prove an incidence theorem for points and planes in the projective space $\mathbb P^3$ over any field $\mathbb F$, whose characteristic $p\neq 2.$ An incidence is viewed as an intersection along a line of a pair of two-planes from two…
We study paving matroids, their realization spaces, and their closures, along with matroid varieties and circuit varieties. Within this context, we introduce three distinct methods for generating polynomials within the associated ideals of…
The calculation of scattering amplitudes at higher orders in perturbation theory has reached a high degree of maturity. However, their usage to produce physical predictions within Monte Carlo programs is often precluded by the slow…
This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…
The classical volume polynomial in algebraic geometry measures the degrees of ample (and nef) divisors on a smooth projective variety. We introduce an analogous volume polynomial for matroids, and give a complete combinatorial formula. For…
Enumeration of all combinatorial types of point configurations and polytopes is a fundamental problem in combinatorial geometry. Although many studies have been done, most of them are for 2-dimensional and non-degenerate cases. Finschi and…
Correspondence is a ubiquitous problem in computer vision and graph matching has been a natural way to formalize correspondence as an optimization problem. Recently, graph matching solvers have included higher-order terms representing…