Sciweavers

CCCG
2010
14 years 2 months ago
Computing the straight skeleton of a monotone polygon in O(n log n) time
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...
CCCG
2010
14 years 2 months ago
Watchman route in a simple polygon with a rubberband algorithm
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...
Fajie Li, Reinhard Klette
COMPGEOM
1995
ACM
14 years 4 months ago
Approximate Range Searching
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...
Sunil Arya, David M. Mount
IMR
2000
Springer
14 years 4 months ago
Quadrilateral Meshing with Anisotropy and Directionality Control via Close Packing of Rectangular Cells
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
Naveen Viswanath, Kenji Shimada, Takayuki Itoh
IMR
2000
Springer
14 years 4 months ago
Generation of Volume Meshes by Extrusion from Surface Meshes of Arbitrary Topology
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...
IMR
2000
Springer
14 years 4 months ago
An Angle-Based Approach to Two-Dimensional Mesh Smoothing
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...
Tian Zhou, Kenji Shimada
IMR
2000
Springer
14 years 4 months ago
High Quality Anisotropic Tetrahedral Mesh Generation Via Ellipsoidal Bubble Packing
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...
Soji Yamakawa, Kenji Shimada
COMPGEOM
2001
ACM
14 years 4 months ago
Computational geometry for sculpture
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...
George W. Hart
ESA
2004
Springer
124views Algorithms» more  ESA 2004»
14 years 4 months ago
Code Flexibility and Program Efficiency by Genericity: Improving Cgal's Arrangements
Arrangements of planar curves are fundamental structures in computational geometry. We describe the recent developments in the arrangement package of Cgal, the Computational Geomet...
Efi Fogel, Ron Wein, Dan Halperin