In the paper we present LGS -- a geometric constraint solver developed at LEDAS Ltd. We review different approaches in geometric constraint solving, present our one, describe in details LGS architecture and the ideas behind it. The main idea of LGS is to decompose the initial problem into a set of simpler ones, to map each instance to a class of problems, and to apply a specialized algorithm to each class. We emphasize key differences of our approach: extendible hierarchy of problem classes, new decomposition techniques, a broad range of numerical algorithms.

References in zbMATH (referenced in 15 articles )

Showing results 1 to 15 of 15.
Sorted by year (citations)

  1. Jia, Zhen; Deng, Guangming: Adaptive nonlinear generalized synchronization of chaotic systems with uncertain parameters (2010)
  2. Kawanoue, Hiraku; Matsuki, Kenji: Toward resolution of singularities over a field of positive characteristic (The idealistic filtration program). II: Basic invariants associated to the idealistic filtration and their properties (2010)
  3. Kolar-Begović, Zdenka; Volenec, Vladimir: LGS-quasigroups. (2009)
  4. Yu, Binbing; Barrett, Michael J.; Kim, Hyune-Ju; Feuer, Eric J.: Estimating joinpoints in continuous time scale for multiple change-point models (2007)
  5. Alfakih, A. Y.: A remark on the faces of the cone of Euclidean distance matrices (2006)
  6. Fiedor, S. J.; Ottino, J. M.: Mixing and segegration of granular matter: multi-lobe formation in time-periodic flows (2005)
  7. Tarazaga, Pablo: Faces of the cone of Euclidean distance matrices: characterizations, structure and induced geometry (2005)
  8. Ershov, Alexey; Ivanov, Ilia; Preis, Serge; Rukoleev, Eugene; Ushakov, Dmitry: LGS: geometric constraint solver (2003) ioport
  9. Nikolaidou, Maria: Time and space-efficient method for the determination of a longest common subsequence of several sequences (2000)
  10. Papula, Lothar: Mathematics for engineers and scientists. A text and workbook for undergraduate courses (2000)
  11. Miller, Philip H.: Strong generative capacity. The semantics of linguistic formalism (1999)
  12. Betancor, Diego; Goldberg, Robert; Goykadosh, Aron; Shapiro, Jacob; Waxman, Jerry: Link factors and search modes in level graph searches (1995)
  13. Shapiro, Jacob; Waxman, Jerry: Experimental analysis of three level graph algorithms: Computational efficiency v.s. path optimality (1993)
  14. Shapiro, Jacob; Waxman, Jerry; Chen, Kailai: Near-point heuristics for rank constrained level graphs (1992)
  15. Shapiro, Jacob; Waxman, Jerry; Nir, Danny: Level graphs and approximate shortest path algorithms (1992)