Happy Face Murders

Happy Face Murders is a 1999 American made-for-television crime drama film directed by Brian Trenchard-Smith. It is based on a real story.

Happy Face Murders
Promotional poster
Written byJohn Pielmeier
Directed byBrian Trenchard-Smith
StarringAnn-Margret
Marg Helgenberger
Henry Thomas
Music byPeter Bernstein
Country of originUnited States
Original language(s)English
Production
Executive producer(s)John Cosgrove
Terry Dunn Meurer
Producer(s)Diane Jeanne
Ned Welsh
CinematographyAlbert J. Dunk
Editor(s)Bill Goddard
Running time100 minutes
Production company(s)Paramount Pictures
Release
Original networkShowtime
Original releaseSeptember 5, 1999 (1999-09-05)

It was shot in 21 days[1] and is one of director Brian Trenchard-Smith's favourite films.[2]

Plot synopsis

Lorraine Petrovich (Ann-Margret) frames her abusive lover killing a young intellectually disabled girl by creating details of the murder from clues she picks up from Detective Jennifer Powell (Marg Helgenberger). Powell works the case with law doctoral student Dylan McCarthy (Henry Thomas), whom she repeatedly calls "Doc", despite McCarthy not actually being a doctor yet. After implicating herself, resulting in her jail sentence, she then recants her testimony but no one believes her, until clues surface from the real killer, who leaves messages that he is still out there, has killed before, and will kill again, signing his victims with Happy Faces.

Cast

Reception

David Nusair of Reel Film Reviews gave a positive review on Marg Helgenberger's performance, writing she "provides enough charm to make it worth a look."

gollark: Sounds interesting, can I haz link plooz?
gollark: `WeAreGoingToWriteOutExactlyWhatThisDoesInTheTypeNameForSomeReason`
gollark: It's not bad, it's just bad.
gollark: ```GoalsThese goals may change or be refined over time as I experiment with what is possible with the language. Embeddable - Similiar to Lua - it is meant to be included in another program which may use the virtual machine to extend its own functionality. Statically typed - The language uses a Hindley-Milner based type system with some extensions, allowing simple and general type inference. Tiny - By being tiny, the language is easy to learn and has a small implementation footprint. Strict - Strict languages are usually easier to reason about, especially considering that it is what most people are accustomed to. For cases where laziness is desired, an explict type is provided. Modular - The library is split into parser, typechecker, and virtual machine + compiler. Each of these components can be use independently of each other, allowing applications to pick and choose exactly what they need.```
gollark: That's rude.

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.