We investigate a new way to represent arbitrary triangle meshes. We prove that a large class of triangle meshes, called normal triangle meshes, can be represented by a subdivision tree, where each subdivision is one of four elementary subdivision types. We also show how to partition an arbitrary

We investigate a new way to represent arbitrary triangle meshes. We prove that a large class of triangle meshes, called normal triangle meshes, can be represented by a subdivision tree, where each subdivision is one of four elementary subdivision types. We also show how to partition an arbitrary

In this paper, we investigate subdivision tree representations of arbitrary triangle meshes. By subdivision, we mean the recursive topological partitioning of a triangle into subtriangles. Such a process can be represented by a subdivision tree. We identify the class of regular triangle meshes

each edge in G can be subdivided at most once) in order to increase the domination number. Arumugam has shown that for any tree, the domination subdivision number always lies between one and three inclusive. In this paper, we provide a constructive characterization of trees whose domination subdivision

Abstract. Let Π (k) be the poset of partitions of {1,2,..., (n − 1)k + 1} with (n−1)k+1 block sizes congruent to 1 modulo k. We prove that the order complex ∆(Π (k) (n−1)k+1) is a subdivision of the complex of k-trees T k n, thereby answering a question posed by Feichtner [F, 5.2]. The result

A classical problem in computational geometry is the planar point location problem. This problem calls for preprocessing a polygonal subdivision of the plane defined by n line segments so that, given a sequence of points, the polygon containing each point can be determined quickly on

The domination subdivision number sdγ(G) of a graph G is the minimum number of edges that must be subdivided to increase the domination number of G. We present a simple characterization of trees with sdγ =1 and a fast algorithm to determine whether a tree has this property.

is concentrated only on trees. We present a characterization of those graphs, whose lict sub-division graph is planar, outerplanar, maximal outerplanar and minimally nonouterplanar. Further, we also establish the characterization for Pn[S(T)] to be eulerian and hamiltonian. Key Words: pathos, path number

, in their paper entitled “Trees with domination subdivision number three,” gave two characterizations of trees whose domination subdivision number is three. In this paper we characterize all trees whose domination subdivision number is one.

all strong-γw-1subdivisible and strong-γw-2-subdivisible trees and give some properties of strong-γw-k-subdivisible graphs for k =1, 2.