Uniform generation in spatial constraint databases and applications

DOI10.1016/j.jcss.2005.09.008zbMath1094.68022OpenAlexW1561988878MaRDI QIDQ2495401

David Gross-Amblard, Michel de Rougemont

Publication date: 30 June 2006

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2005.09.008

zbMATH Keywords

volumesamplinggeneratorconstraint databasesapproximationdimensionestimator

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form
• Monte-Carlo algorithms for the planar multiterminal network reliability problem
• Random generation of combinatorial structures from a uniform distribution
• A geometric inequality and the complexity of computing volume
• Geometric algorithms and combinatorial optimization
• Complete geometric query languages
• Finitely representable databases
• Queries with arithmetical constraints
• An expressive language for linear spatial database queries
• Query size estimation by adaptive sampling
• On the convex hull of uniform random points in a simple \(d\)-polytope
• Relational queries over interpreted structures
• Relational expressive power of constraint query languages
• A random polynomial-time algorithm for approximating the volume of convex bodies
• Random walks and anO*(n5) volume algorithm for convex bodies
• Safe Constraint Queries

This page was built for publication: Uniform generation in spatial constraint databases and applications