×

Found 91 Documents (Results 1–91)

Accelerated subdivision for clustering roots of polynomials given by evaluation oracles. (English) Zbl 1514.68326

Boulier, François (ed.) et al., Computer algebra in scientific computing. 24th international workshop, CASC 2022, Gebze, Turkey, August 22–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13366, 143-164 (2022).
MSC:  68W30 12D10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Certified approximation algorithms for the Fermat point and \(n\)-ellipses. (English) Zbl 07740909

Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 54, 19 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Rods and rings: soft subdivision planner for \(\mathbb{R}^3\times S^2\). (English) Zbl 07559243

Barequet, Gill (ed.) et al., 35th international symposium on computational geometry, SoCG 2019, Portland, Oregon, USA, June 18–21, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 129, Article 43, 17 p. (2019).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Effective subdivision algorithm for isolating zeros of real systems of equations, with complexity analysis. (English) Zbl 1467.65051

Bradford, Russell (ed.), Proceedings of the 44th international symposium on symbolic and algebraic computation, ISSAC ’19, Beijing, China, July 15–18, 2019. New York, NY: Association for Computing Machinery (ACM). 355-362 (2019).
MSC:  65H04 68W40
PDFBibTeX XMLCite
Full Text: DOI arXiv

Plantinga-Vegter algorithm takes average polynomial time. (English) Zbl 1467.14150

Bradford, Russell (ed.), Proceedings of the 44th international symposium on symbolic and algebraic computation, ISSAC ’19, Beijing, China, July 15–18, 2019. New York, NY: Association for Computing Machinery (ACM). 114-121 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Covering and packing of rectilinear subdivision. (English) Zbl 1522.68650

Das, Gautam K. (ed.) et al., WALCOM: algorithms and computation. 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11355, 381-393 (2019).
MSC:  68U05 68Q17 68W25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Point location in dynamic planar subdivisions. (English) Zbl 1489.68370

Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 99, Article 63, 14 p. (2018).
MSC:  68U05 68P05 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the complexity of finding internally vertex-disjoint long directed paths. (English) Zbl 1485.68171

Bender, Michael A. (ed.) et al., Latin 2018: theoretical informatics. 13th Latin American symposium, Buenos Aires, Argentina, April 16–19, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10807, 66-79 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Near optimal subdivision algorithms for real root isolation. (English) Zbl 1345.65035

Proceedings of the 40th international symposium on symbolic and algebraic computation, ISSAC 2015, Bath, UK, July 6–9, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3435-8). 331-338 (2015).
MSC:  65H04 12D10 12Y05 68W30
PDFBibTeX XMLCite
Full Text: DOI arXiv

On soft predicates in subdivision motion planning. (English) Zbl 1305.68288

Proceedings of the 29th annual symposium on computational geometry, SoCG 2013, Rio de Janeiro, Brazil, June 17–20, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2031-3). 349-358 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Acyclic colorings of graph subdivisions. (English) Zbl 1314.05075

Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 22nd international workshop, IWOCA 2011, Victoria, BC, Canada, July 20–22, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25010-1/pbk). Lecture Notes in Computer Science 7056, 247-260 (2011).
PDFBibTeX XMLCite
Full Text: DOI

A heuristic knowledge reduction algorithm based on partition subdivision and consistent degree. (English) Zbl 1162.68543

Shi, Zhongzhi (ed.) et al., Intelligent information processing IV. 5th IFIP international conference on intelligent information processing, October 19–22, 2008, Beijing, China. New York, NY: Springer (ISBN 978-0-387-87684-9/hbk). IFIP, International Federation for Information Processing 288, 109-117 (2008).
MSC:  68T05 68W05
PDFBibTeX XMLCite
Full Text: DOI

\(\kappa\)-compatible tessellations. (English) Zbl 1134.65326

Brewer, Michael L. (ed.) et al., Proceedings of the 16th international meshing roundtable, Seattle, WA, USA, October 14–17, 2007. Berlin: Springer (ISBN 978-3-540-75102-1/hbk). 423-440 (2008).
MSC:  65D18 68U05 65N30
PDFBibTeX XMLCite

Computing sparse projection operators. (English) Zbl 1013.14017

Green, Edward L. (ed.) et al., Symbolic computation: Solving equations in algebra, geometry, and engineering. Proceedings of an AMS-IMS-SIAM joint summer research conference, Mount Holyoke College, South Hadley, MA, USA, June 11-15, 2000. Providence, RI: AMS, American Mathematical Society. Contemp. Math. 286, 121-139 (2001).
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software