Point-based polygonal models for random graphs
From MaRDI portal
Publication:5286949
Recommendations
Cited in
(19)- Arak-Clifford-Surgailis tessellations. Basic properties and variance of the total edge length
- Discrete multicolour random mosaics with an application to network extraction
- Image segmentation by polygonal Markov fields
- Border aggregation model
- Statistical inference for random T-tessellations models. Application to agricultural landscape modeling
- Topological relationships in spatial tessellations
- Learning random points from geometric graphs or orderings
- Non-homogeneous polygonal Markov fields in the plane: graphical representations and geometry of higher order correlations
- scientific article; zbMATH DE number 16751 (Why is no real title available?)
- Random dynamics and thermodynamic limits for polygonal Markov fields in the plane
- Perfect Simulation for Length‐interacting Polygonal Markov Fields in the Plane
- Crack STIT tessellations: characterization of stationary random tessellations stable with respect to iteration
- A large class of random tessellations with the classic Poisson polygon distributions
- Efficient Simulation of Sparse Graphs of Point Processes
- Dobrushin-Kotecký-Shlosman theorem for polygonal Markov fields in the plane
- Polygonal web representation for higher order correlation functions of consistent polygonal Markov fields in the plane
- Disagreement loop and path creation/annihilation algorithms for binary planar Markov fields with application to image segmentation
- How many T-tessellations on \(k\) lines? Existence of associated Gibbs measures on bounded convex domains
- Sensitivity analysis and uncertainty quantification for environmental models
This page was built for publication: Point-based polygonal models for random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286949)
