A new algorithm for computing Boolean operations on polygons

TL;DR: This work detail new global readability metrics on a "0,1] continuous scale for node-node overlap, edge crossing angle, angular resolution, group overlap, and visualization coverage, and describes the trade-offs inherent in optimizing individual metrics as well as recommend metric optimizations for particular tasks.

TL;DR: A formal geofence definition and a methodology to use geofences to temporally and spatially organize the airspace in support of a UAS Traffic Management (UTM) system are presented.

TL;DR: This is the first large-scale fully-automated channel modeling study of mmWave cells over massive open building data, allowing for a more accurate modeling of small-cell mmWave access networks, which are currently considered as a strong candidate technology for providing gigabit rates to dense urban areas.

TL;DR: The results show that with the new model, the topological relations can be computed in a simple way without referring to dimension, which is significant given the increased dimensionality of geographic information in the digital era.

TL;DR: In this article, the authors present a coherent treatment of computational geometry in the plane, at the graduate textbook level, and point out the way to the solution of the more challenging problems in dimensions higher than two.

TL;DR: These are the short notes for a two hour tutorial on principles and practice of computer graphics and scientific visualization and they cannot completely replace the contents of the tutorial transparencies and slides since restrictions in space and print quality do not permit the inclusion of figures and example images.

TL;DR: A new family of clipping algorithms is described, able to clip polygons against irregular convex plane-faced volumes in three dimensions, removing the parts of the polygon which lie outside the volume.