## Search

Now showing items 1-6 of 6

#### Hitting Geometric Range Spaces using a Few Points

(2018-02-15)

A range space (P, S) consists of a set P of n elements and a collection S = {S1,...,Sm} of subsets of P , referred to as ranges. A hitting set for this range space refers to a subset H of P such that every Si in S contains ...

#### Computational And Combinatorial Problems On Some Geometric Proximity Graphs

(2017-05-24)

In this thesis, we focus on the study of computational and combinatorial problems on various geometric proximity graphs. Delaunay and Gabriel graphs are widely studied geometric proximity structures. These graphs have been ...

#### Variants and Generalization of Some Classical Problems in Combinatorial Geometry

(2018-02-18)

In this thesis we consider extensions and generalizations of some classical problems
in Combinatorial Geometry. Our work is an offshoot of four classical problems in
Combinatorial Geometry. A fundamental assumption in these ...

#### Delaunay Graphs for Various Geometric Objects

(2017-12-12)

Given a set of n points P ⊂ R2, the Delaunay graph of P for a family of geometric objects C is a graph defined as follows: the vertex set is P and two points p, p' ∈ P are connected by an edge if and only if there exists ...

#### Symmetry in Scalar Fields

(2018-01-09)

Scalar fields are used to represent physical quantities measured over a domain of interest. Study of symmetric or repeating patterns in scalar fields is important in scientific data analysis because it gives deep insights ...

#### Module Grobner Bases Over Fields With Valuation

(2017-07-12)

Tropical geometry is an area of mathematics that interfaces algebraic geometry and combinatorics. The main object of study in tropical geometry is the tropical variety, which is the combinatorial counterpart of a classical ...