Our strategy for handling intersections robustly in floating point is to register degeneracies with tolerances in a hierarchical manner before registering the top level intersection primitives in order from most degenerate (vertex-vertex) to least, followed by the top level primitives (edge-edge and triangle-vertex in 2D, triangleedge and tetrahedron-vertex in 3D). Intersection pairs are stored...

We combine the known notion of the edge intersection graphs of paths in a tree with a VLSI grid layout model to introduce the edge intersection graphs of paths on a grid. Let P be a collection of nontrivial simple paths on a grid G. We define the edge intersection graph EPG(P) of P to have vertices which correspond to the members of P, such that two vertices are adjacent in EPG(P) if the corres...

We present a method for finding the overlays of a set of polygons that uses the doubly-connected edge list structure. We first detect all intersections between polygons using a brute-force method. We then build the doubly-connected edge list, maintaining information about the original polygons, from which we can easily perform shapefile overlay operations: intersection, difference, and union. O...

Edge-Path-Tree graphs are intersection graphs of Edge-Path-Tree matrices that is matrices whose columns are incidence vectors of edge-sets of paths in a given tree. Edge-Path-Tree graphs have polynomially many cliques as proved in [4] and [7]. Therefore, the problem of finding a clique of maximum weight in these graphs is solvable in strongly polynomial time. In this paper we extend this result...

Deciding realizability of a given polyhedral map on a (compact, connected) surface belongs to the hard problems in discrete geometry, from the theoretical, the algorithmic, and the practical point of view. In this paper, we present a heuristic algorithm for the realization of simplicial maps, based on the intersection edge functional. The heuristic was used to find geometric realizations in R f...

The creation of detailed 3D buildings models, and to a greater extent the creation of entire city models, has become an area of considerable research over the last couple of decades. The accurate modeling of buildings has LBS (Location Based Services) applications in entertainment, planning, tourism and e-commerce to name just a few. Many modeling systems created to date require manual correspo...

ABSTRACT Let ‎G=(V,E) ‎be a‎ ‎simple ‎connected ‎graph ‎with ‎vertex ‎set ‎V‎‎‎ ‎and ‎edge ‎set ‎‎‎E. ‎The Szeged index ‎of ‎‎G is defined by ‎ where ‎ respectively ‎ ‎ is the number of vertices of ‎G ‎closer to ‎u‎ (‎‎respectively v)‎ ‎‎than ‎‎‎v (‎‎respectively u‎).‎ ‎‎If ‎‎‎‎S ‎is a‎ ‎set ‎of ‎size‎ ‎ ‎ ‎let ‎‎V ‎be ‎the ‎set ‎of ‎all ‎subsets ‎of ‎‎S ‎of ‎size ‎3. ‎Then ‎we ‎define ‎t...

We give a characterization for fundamental groups of graphs of groups amalgamating cyclic edge subgroups to be cyclic subgroup separable if each pair of edge subgroups has a non-trivial intersection. We show that fundamental groups of graphs of abelian groups amalgamating cyclic edge subgroups are cyclic subgroup separable, hence residually finite, if each edge subgroup is isolated in its conta...