Triangulations intersect nicely
- 1 April 1996
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 16 (4) , 339-359
- https://doi.org/10.1007/bf02712872
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Approaching the largest β-skeleton within a minimum weight triangulationPublished by Association for Computing Machinery (ACM) ,1996
- Constrained independence system and triangulations of planar point setsPublished by Springer Nature ,1995
- Computing a subgraph of the minimum weight triangulationComputational Geometry, 1994
- Fast greedy triangulation algorithmsPublished by Association for Computing Machinery (ACM) ,1994
- SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORSInternational Journal of Computational Geometry & Applications, 1992
- A space efficient greedy triangulation algorithmInformation Processing Letters, 1989
- Which triangulations approximate the complete graph?Published by Springer Nature ,1989
- Some properties of basic families of subsetsDiscrete Mathematics, 1973
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Comments on bases in dependence structuresBulletin of the Australian Mathematical Society, 1969