Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
3.7
2.3
Journals
Algorithms
Special Issues
Computational Geometry
share announcement

Computational Geometry

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (30 July 2009) | Viewed by 25641

Special Issue Editors

Dr. Adrian Dumitrescu

E-Mail Website
Guest Editor
University of Wisconsin-Milwaukee; 3200 N. Cramer Street Milwaukee, WI 53211, USA
Interests: theory of algorithms; computational and combinatorial geometry; combinatorics; computational morphology; robotics
Prof. Dr. Takeshi Tokuyama

E-Mail Website
Guest Editor
Graduate School of Information Sciences (GSIS), Tohoku University, Aramaki Aza-Aoba, Aoba, Sendai 980-8579, Japan
Interests: theoretical computer science and discrete mathematics; computational geometry and related combinatorics; new horizons in computing: recent trends in theoretical computer science

Special Issue Information

"Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational geometry." (from http://en.wikipedia.org/wiki/Computational_geometry)

Keywords

  • combinatorial computational geometry
  • algorithmic geometry
  • numerical computational geometry (machine geometry)
  • computer-aided geometric design (CAGD)
  • geometric modeling

Published Papers (3 papers)

Download All Papers
Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

3512 KiB  
Article
Delaunay Meshing of Piecewise Smooth Complexes without Expensive Predicates
by Tamal K. Dey and Joshua A. Levine
Algorithms 2009, 2(4), 1327-1349; https://doi.org/10.3390/a2041327 - 11 Nov 2009
Cited by 33 | Viewed by 7855
Abstract
Recently a Delaunay refinement algorithm has been proposed that can mesh piecewise smooth complexes which include polyhedra, smooth and piecewise smooth surfaces, and non-manifolds. However, this algorithm employs domain dependent numerical predicates, some of which could be computationally expensive and hard to implement. [...] Read more.
Recently a Delaunay refinement algorithm has been proposed that can mesh piecewise smooth complexes which include polyhedra, smooth and piecewise smooth surfaces, and non-manifolds. However, this algorithm employs domain dependent numerical predicates, some of which could be computationally expensive and hard to implement. In this paper we develop a refinement strategy that eliminates these complicated domain dependent predicates. As a result we obtain a meshing algorithm that is practical and implementation-friendly. Full article
(This article belongs to the Special Issue Computational Geometry)
►▼ Show Figures

Figure 1

1896 KiB  
Article
Optimal 2-Coverage of a Polygonal Region in a Sensor Network
by Manuel Abellanas, Antonio L. Bajuelos and Inês Matos
Algorithms 2009, 2(3), 1137-1154; https://doi.org/10.3390/a2031137 - 14 Sep 2009
Cited by 3 | Viewed by 7551
Abstract
Wireless sensor networks are a relatively new area where technology is developing fast and are used to solve a great diversity of problems that range from museums’ security to wildlife protection. The geometric optimisation problem solved in this paper is aimed at minimising [...] Read more.
Wireless sensor networks are a relatively new area where technology is developing fast and are used to solve a great diversity of problems that range from museums’ security to wildlife protection. The geometric optimisation problem solved in this paper is aimed at minimising the sensors’ range so that every point on a polygonal region R is within the range of at least two sensors. Moreover, it is also shown how to minimise the sensors’ range to assure the existence of a path within R that stays as close to two sensors as possible. Full article
(This article belongs to the Special Issue Computational Geometry)
►▼ Show Figures

Figure 1

251 KiB  
Article
How Many Lions Are Needed to Clear a Grid?
by Florian Berger, Alexander Gilbers, Ansgar Grüne and Rolf Klein
Algorithms 2009, 2(3), 1069-1086; https://doi.org/10.3390/a2031069 - 07 Sep 2009
Cited by 17 | Viewed by 9498
Abstract
We consider a pursuit-evasion problem where some lions have the task to clear a grid graph whose nodes are initially contaminated. The contamination spreads one step per time unit in each direction not blocked by a lion. A vertex is cleared from its [...] Read more.
We consider a pursuit-evasion problem where some lions have the task to clear a grid graph whose nodes are initially contaminated. The contamination spreads one step per time unit in each direction not blocked by a lion. A vertex is cleared from its contamination whenever a lion moves to it. Brass et al. [5] showed that n/2 lions are not enough to clear the n x n-grid. In this paper, we consider the same problem in dimension d > 2 and prove that Θ(nd-1/√d) lions are necessary and sufficient to clear the nd-grid. Furthermore, we analyze a problem variant where the lions are also allowed to jump from grid vertices to non-adjacent grid vertices. Full article
(This article belongs to the Special Issue Computational Geometry)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-3
Back to TopTop