Learn More
We present eecient polynomial time algorithms that place bn=2c vertex guards which cover the surface of an n-vertex polyhedral terrain, and similarly, bn=3c edge guards which cover the surface of an n-vertex polyhedral terrain. The time complexity of both algorithms, dominated by the cost of nding a maximum matching in a graph, is O(n 3=2).
1 Institute for Telecommunications Research, University of South Australia, SPRI Building, Mawson Lakes Boulevard, Mawson Lakes, SA 5095, Australia 2Eurécom Institute, 2229 Route des Crêtes, 06904 Sophia Antipolis, France 3Electrical Engineering Department, University of Southern California, 3740 McClintock Avenue, Los Angeles, CA 90089, USA 4Motorola Labs,(More)
We present an optimal (n)-time algorithm for the selection of a subset of the vertices of an nvertex plane graph G so that each of the faces of G is covered by (i.e. incident with) one or more of the selected vertices. At most bn=2 vertices are selected, matching the worst-case requirement. Analogous results for edge-covers are developed for two different(More)
In this paper, the mooring dynamic loads and the motion responses of a large container ship in irregular waves with steady wind and current is investigated based on the commercial software AQWA. Comparisons between the time-history motion responses of a large container ship and the change of the mooring line tension in three different cases, non-mooring(More)
  • 1