AbstractWe review properties of acute and non-obtuse simplices, and of ortho-simplices and path-simplices. Dissection of path-simplices is considered, which leads to a new result: generalization of Coxeter’s trisection of a path-tetrahedron into three path-subtetrahedra to arbitrary spatial dimension n. Moreover, following earlier results by Korotov and Křížek, we show that applying this procedure recursively in the proper way leads to a self-similar path-simplicial refinement towards a chosen vertex of the original path-simplex
2021 Fall.Includes bibliographical references.A convex polyhedron is the convex hull of a finite set...
We investigate the problem of creating simplified representations of polygonal paths. Specifically,...
We investigate the problem of creating simplified representations of polygonal paths. Specifically,...
AbstractWe review properties of acute and non-obtuse simplices, and of ortho-simplices and path-simp...
This paper surveys some results on acute and nonobtuse simplices and associated spatial partitions. ...
Aset P of n points in R d is called simplicial if it has dimension d and contains exactly d + 1extre...
This thesis focuses on the study of certain special classes of n-simplices that occur in the context...
We consider the problem of determining the length of the shortest paths between points on the surfac...
This monograph sets forth the results of a study of the geometry of a simplex, multiply-cut by hyper...
We show that in dimensions higher than two, the popular "red refinement" technique, commonly used fo...
In their development of the Field D* algorithm, Ferguson et. al. prove that a path through a unit le...
20 pages, long version of proceedings at Eurocomb 2011.International audienceThis article presents n...
20 pages, long version of proceedings at Eurocomb 2011.International audienceThis article presents n...
There are essentially two ways to decompose a (compact, connected) d-mani-fold (without boundary) in...
Abstract. This article presents new enumerative results related to symmetric planar maps. In the fir...
2021 Fall.Includes bibliographical references.A convex polyhedron is the convex hull of a finite set...
We investigate the problem of creating simplified representations of polygonal paths. Specifically,...
We investigate the problem of creating simplified representations of polygonal paths. Specifically,...
AbstractWe review properties of acute and non-obtuse simplices, and of ortho-simplices and path-simp...
This paper surveys some results on acute and nonobtuse simplices and associated spatial partitions. ...
Aset P of n points in R d is called simplicial if it has dimension d and contains exactly d + 1extre...
This thesis focuses on the study of certain special classes of n-simplices that occur in the context...
We consider the problem of determining the length of the shortest paths between points on the surfac...
This monograph sets forth the results of a study of the geometry of a simplex, multiply-cut by hyper...
We show that in dimensions higher than two, the popular "red refinement" technique, commonly used fo...
In their development of the Field D* algorithm, Ferguson et. al. prove that a path through a unit le...
20 pages, long version of proceedings at Eurocomb 2011.International audienceThis article presents n...
20 pages, long version of proceedings at Eurocomb 2011.International audienceThis article presents n...
There are essentially two ways to decompose a (compact, connected) d-mani-fold (without boundary) in...
Abstract. This article presents new enumerative results related to symmetric planar maps. In the fir...
2021 Fall.Includes bibliographical references.A convex polyhedron is the convex hull of a finite set...
We investigate the problem of creating simplified representations of polygonal paths. Specifically,...
We investigate the problem of creating simplified representations of polygonal paths. Specifically,...