The straight skeleton of a simple polygon is defined as the trace of the vertices when the initial polygon is shrunken in self-parallel manner [2]. In this paper, we propose a sim...
Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy...
So far, the best result in running time for solving the fixed watchman route problem (i.e., shortest path for viewing any point in a simple polygon with given start point) is O(n3...
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
A new technique for automatically generating anisotropic quadrilateral meshes is presented in this paper. The inputs are (1) a 2D geometric domain and (2) a desired anisotropy
An algorithm to generate volume meshes by extrusion from surface meshes of arbitrary topology is presented. The algorithm utilizes a three-step, advancing layer scheme to extrude ...
David S. Thompson, Satish Chalasani, Bharat K. Son...
We present an effective and easy-to-implement angle-based smoothing scheme for triangular, quadrilateral and tri-quad mixed meshes. For each mesh node our algorithm compares all t...
This paper presents a new computational method for anisotropic tetrahedral meshing that (1) can control shapes of the elements by an arbitrary anisotropy function, and (2) can avo...
This presentation illustrates examples of my geometric sculpture and outlines certain design techniques. I apply methods from the field of computational geometry to the creation o...
Arrangements of planar curves are fundamental structures in computational geometry. We describe the recent developments in the arrangement package of Cgal, the Computational Geomet...