Building Convex Hulls by Combining (ResearchIndex)

See this document in CiteSeerX!

Building Convex Hulls by Combining (2003) (Make Corrections)
SAT Solving and Algebric Computing Silvio Ranise LORIA INRIA-Lorraine...

Home/Search Context Related

Rate this article:

(Enter summary)
Abstract: Geometric algorithms (such as those for computing convex hulls) are quite difficult to be implemented correctly and efficiently. This is so because of errors deriving from arithmetic operations or of contradictory results returned by primitives operations. In this abstract, we present a combination of SAT solving and algebric computing to flexibly build parsimonious algorithms, which are both correct and efficient. We also sketch how the proposed technique can be lifted to handle the case ... (Update)

Active bibliography (related documents): More All
0.5: Research Statement - Saugata Basu Quick (Correct)
0.1: A SAT Based Approach for Solving Formulas over.. - Audemard.. (2002) (Correct)
0.1: Centro Per La Ricerca - Scientifica Tecnologica Povo (Correct)

Similar documents based on text: More All
0.4: BDD-Driven First-Order Satisfiability Procedures - Déharbe, Ranise (Correct)
0.4: Constraint Contextual Rewriting - Armando, Ranise (1998) (Correct)
0.4: Light-Weight Theorem Proving for Debugging and Verifying.. - Deharbe, Ranise (2003) (Correct)

BibTeX entry: (Update)

@misc{ and-building,
  author = "Sat Solving And",
  title = "Building Convex Hulls by Combining",
  url = "citeseer.ist.psu.edu/703421.html" }