Review of Computational Geometry: Algorithms and Applications (2nd ed.) by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf

@article{Masum2000ReviewOC,
  title={Review of Computational Geometry: Algorithms and Applications (2nd ed.) by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf},
  author={Hassan Masum},
  journal={SIGACT News},
  year={2000},
  volume={31},
  pages={10-12}
}
  • H. Masum
  • Published 1 December 2000
  • Computer Science
  • SIGACT News
Computational Geometry is a wide-ranging introductory text which exposes readers to the main themes in modern computational geometry. Each chapter introduces a subfield of computational geometry, via natural problems and basic algorithms; exercises and notes help to flesh out the chapter material. This second edition of the book is obviously the product of much effort by the authors, and although some improvements are possible, on the whole this book is worth considering both as a text for a… 
75 Citations

Fast Heuristics for Covering 1.5D Terrain

An approximation algorithm for covering 1.5D terrain by a few number of point guards is proposed which is based on ranking vertices in term of number of visible edges from them and an improvement of the Greedy Ranking Algorithm is presented by making use of visibility graph of the input terrain.

WebShapes: Network Visualization with 3D Shapes

Inspired by this research, a web platform WebShapes is designed that enables researchers and practitioners to visualize their network data as customized 3D shapes and provides a case study on real-world networks to explore the sensitivity of network shapes to different graph sampling, embedding, and fitting methods.

Subtrajectory Clustering: Models and Algorithms

It is shown that the subtrajectory clustering problem is NP-Hard and the algorithm indeed handles the desiderata of being robust to variations, being efficient and accurate, and being data-driven.

PAM: parallel augmented maps

An interface for ordered maps that is augmented to support fast range queries and sums, and a parallel and concurrent library called PAM (Parallel Augmented Maps) that implements the interface are described.

Integral points in rational polygons: a numerical semigroup approach

In this paper we use an elementary approach by using numerical semigroups (specifically, those with two generators) to give a formula for the number of integral points inside a right-angled triangle

Computational Fact Checking through Query Perturbations

A framework that models claims based on structured data as parameterized queries as well as an algorithmic framework that enables efficient instantiations of “meta” algorithms by supplying appropriate algorithmic building blocks is proposed.

ImageBeacon: Broadcasting Color Images over Connectionless Bluetooth LE Packets

  • Chong ShaoS. Nirjon
  • Computer Science
    2017 IEEE/ACM Second International Conference on Internet-of-Things Design and Implementation (IoTDI)
  • 2017
This paper describes the first ‘image beacon’ system that is capable of broadcasting color images over a very long period (years, as opposed to days or weeks) using a set of cheap, low-power,

Cluster-based supply chain logistics: a case study of a Ukrainian food distributor

This article deals with the logistics of a Ukrainian food and consumer goods distributor. Our main goal is to reduce the field costs of the company, which comprise the agent labour costs and company’s

AP-Tree: efficiently support location-aware Publish/Subscribe

This paper provides a highly efficient solution based on a novel adaptive index, named AP-Tree, which adaptively groups registered subscriptions using keyword and spatial partitions, guided by a cost model and can be extended to process moving spatial-keyword subscriptions, where subscribers can continuously update their locations.
...