Interrogating witnesses for geometric constraint solving (Q714618): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ic.2011.09.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2035491704
@@ Property / OpenAlex ID: W2035491704 / rank @@
+Normal rank
@@ Property / cites work @@
+CONSTRAINTS ON SIMPLE GEOMETRY IN TWO AND THREE DIMENSIONS
+Normal rank
@@ Property / cites work @@
+Q4231543
@@ Property / cites work: Q4231543 / rank @@
+Normal rank
@@ Property / cites work @@
+DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY
+Normal rank
@@ Property / cites work @@
+Geometric constraint solver
@@ Property / cites work: Geometric constraint solver / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric constraint solving: the witness configuration method
+Normal rank
@@ Property / cites work @@
+Q4531851
@@ Property / cites work: Q4531851 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4279195
@@ Property / cites work: Q4279195 / rank @@
+Normal rank
@@ Property / cites work @@
+Conditions for Unique Graph Realizations
@@ Property / cites work: Conditions for Unique Graph Realizations / rank @@
+Normal rank
@@ Property / cites work @@
+Q5461825
@@ Property / cites work: Q5461825 / rank @@
+Normal rank
@@ Property / cites work @@
+Realization spaces of polytopes
@@ Property / cites work: Realization spaces of polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Probabilistic Algorithms for Verification of Polynomial Identities
+Normal rank
@@ Property / cites work @@
+Q4274348
@@ Property / cites work: Q4274348 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4473029
@@ Property / cites work: Q4473029 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition plans for geometric constraint systems. I: Performance measures for CAD
+Normal rank
@@ Property / cites work @@
+Decomposition plans for geometric constraint problems. II: New algorithms
+Normal rank