Suchergebnisse - "Randomized Geometric Algorithms"

An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams

Autoren: Cecilia Bohler Rolf Klein Chih-Hung Liu et al.

Weitere Verfasser: Cecilia Bohler Rolf Klein Chih-Hung Liu et al.

Quelle: Algorithmica, 81 (6)

Schlagwörter: Order- k Voronoi diagrams, Abstract Voronoi diagrams, Randomized geometric algorithms, Computational geometry, Abstract Voronoi Diagrams, Order-k Voronoi Diagrams, Randomized Geometric Algorithms, 0102 computer and information sciences, ddc:004, 0101 mathematics, 01 natural sciences

Dateibeschreibung: application/pdf; application/application/pdf

Zugangs-URL: https://drops.dagstuhl.de/opus/volltexte/2016/5913/pdf/LIPIcs-SoCG-2016-21.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.21
http://hdl.handle.net/20.500.11850/341324

An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams

Autoren: Bohler, Cecilia Klein, Rolf Liu, Chih-Hung

Quelle: Algorithmica, 81 (6)

Schlagwörter: Order- k Voronoi diagrams, Abstract Voronoi diagrams, Randomized geometric algorithms, Computational geometry

Dateibeschreibung: application/application/pdf

Relation: info:eu-repo/semantics/altIdentifier/wos/000465544600007; http://hdl.handle.net/20.500.11850/341324

Verfügbarkeit: https://hdl.handle.net/20.500.11850/341324
https://doi.org/10.3929/ethz-b-000341324

An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams

Autoren: Bohler, Cecilia Klein, Rolf Liu, Chih-Hung et al.

Weitere Verfasser: Bohler, Cecilia Klein, Rolf Liu, Chih-Hung et al.

Schlagwörter: Order-k Voronoi Diagrams, Abstract Voronoi Diagrams, Randomized Geometric Algorithms

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.21

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.SoCG.2016.21
https://nbn-resolving.org/urn:nbn:de:0030-drops-59135
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.21

A fast planar partition algorithm, II: A fast planar partition algorithm. II

Autoren: Ketan Mulmuley

Quelle: Journal of the ACM. 38:74-103

Schlagwörter: computational complexity, Algebra and Number Theory, Analysis of algorithms and problem complexity, hidden surface removal, planar subdivision, Combinatorics in computer science, 0102 computer and information sciences, 01 natural sciences, Computational Mathematics, Computer graphics, computational geometry (digital and algorithmic aspects), virtual clipping, computational geometry, randomized geometric algorithms, Parallel algorithms in computer science, 0101 mathematics

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/622310
https://doi.org/10.1145/102782.102785
https://ieeexplore.ieee.org/document/21974/
https://www.sciencedirect.com/science/article/pii/S0747717108800648
https://www.sciencedirect.com/science/article/abs/pii/S0747717108800648
https://dblp.uni-trier.de/db/journals/jsc/jsc10.html#Mulmuley90
https://dblp.uni-trier.de/db/journals/jacm/jacm38.html#Mulmuley91
https://dl.acm.org/doi/10.1145/102782.102785
https://doi.acm.org/10.1145/102782.102785
https://dblp.uni-trier.de/db/conf/compgeom/compgeom89.html#Mulmuley89
https://doi.acm.org/10.1145/73833.73837
https://dl.acm.org/doi/10.1145/73833.73837