A Delaunay based numerical method for three dimensions: generation, formulation, and partition
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Disk packings and planar separators
Proceedings of the twelfth annual symposium on Computational geometry
Separators for sphere-packings and nearest neighbor graphs
Journal of the ACM (JACM)
Quality meshing with weighted Delaunay refinement
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient computation of the topology of level sets
Proceedings of the conference on Visualization '02
Simple and optimal output-sensitive construction of contour trees using monotone paths
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Linear time low tree-width partitions and algorithmic consequences
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Tight bounds for the Min-Max boundary decomposition cost of weighted graphs
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Grad and classes with bounded expansion II. Algorithmic aspects
European Journal of Combinatorics
Studying (non-planar) road networks through an algorithmic lens
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Linear-time algorithms for geometric graphs with sublinearly many crossings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Testing bipartiteness of geometric intersection graphs
ACM Transactions on Algorithms (TALG)
Simple and optimal output-sensitive construction of contour trees using monotone paths
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
Journal of the ACM (JACM)
Superfast Multifrontal Method for Large Structured Linear Systems of Equations
SIAM Journal on Matrix Analysis and Applications
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
SIAM Journal on Computing
Review of bisonet abstraction techniques
Bisociative Knowledge Discovery
A Deterministic Linear Time Algorithm For Geometric Separators And Its Applications
Fundamenta Informaticae
| Hi-index | 0.01 |
We propose a class of graphs that would occur naturally in finite-element and finite-difference problems and we prove a bound on separators for this class of graphs. Graphs in this class are embedded in $d$-dimensional space in a certain manner. For d-dimensional graphs our separator bound is O(n(d-1)d), which is the best possible bound. We also propose a simple randomized algorithm to find this separator in O(n) time. This separator algorithm can be used to partition the mesh among processors of a parallel computer and can also be used for the nested dissection sparse elimination algorithm.