Cargando…
Extreme point and halving edge search in abstract order types
Many properties of finite point sets only depend on the relative position of the points, e.g., on the order type of the set. However, many fundamental algorithms in computational geometry rely on coordinate representations. This includes the straightforward algorithms for finding a halving line for...
Autores principales: | Aichholzer, Oswin, Miltzow, Tillmann, Pilz, Alexander |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3688538/ https://www.ncbi.nlm.nih.gov/pubmed/24092953 http://dx.doi.org/10.1016/j.comgeo.2013.05.001 |
Ejemplares similares
-
Pointed drawings of planar graphs()
por: Aichholzer, Oswin, et al.
Publicado: (2012) -
Blocking Delaunay triangulations
por: Aichholzer, Oswin, et al.
Publicado: (2013) -
Genome Halving with an Outgroup
por: Zheng, Chunfang, et al.
Publicado: (2007) -
Osteoarthritis and the Rule of Halves
por: Sheikh, L., et al.
Publicado: (2014) -
Perfect k-Colored Matchings and [Formula: see text] -Gonal Tilings
por: Aichholzer, Oswin, et al.
Publicado: (2018)