In this paper we present a novel method to compute Boolean operations on polygonal meshes. Given a Boolean expression over an arbitrary number of input meshes we reliably and effi...
Let P be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of P with bounded vertex degree is within a factor O(H3 P ) of the size of any Dela...
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
Nan Wang, Jingbo Zhang, Kian-Lee Tan, Anthony K. H...
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
If we abstract a sensor network as a network graph consisting of vertices and edges, where vertices represent sensor nodes and edges represent distance measurements between neighbo...